Parking Functions And Generalized Catalan Numbers

Simple item page
dc.contributorYan, Catherine
dc.creatorSchumacher, Paul R.
dc.date.accessioned2010-01-14T23:55:09Z
dc.date.accessioned2010-01-16T00:16:47Z
dc.date.accessioned2017-04-07T19:54:40Z
dc.date.available2010-01-14T23:55:09Z
dc.date.available2010-01-16T00:16:47Z
dc.date.available2017-04-07T19:54:40Z
dc.date.created2009-08
dc.date.issued2010-01-14
dc.description.abstractSince their introduction by Konheim and Weiss, parking functions have evolved into objects of surprising combinatorial complexity for their simple definitions. First, we introduce these structures, give a brief history of their development and give a few basic theorems about their structure. Then we examine the internal structures of parking functions, focusing on the distribution of descents and inversions in parking functions. We develop a generalization to the Catalan numbers in order to count subsets of the parking functions. Later, we introduce a generalization to parking functions in the form of k-blocked parking functions, and examine their internal structure. Finally, we expand on the extension to the Catalan numbers, exhibiting examples to explore its internal structure. These results continue the exploration of the deep structures of parking functions and their relationship to other combinatorial objects.
dc.identifier.urihttp://hdl.handle.net/1969.1/ETD-TAMU-2009-08-853
dc.language.isoen_US
dc.subjectParking Functions
dc.subjectInversions
dc.subjectDescents
dc.subjectLinear Probes
dc.subjectCatalan Numbers
dc.titleParking Functions And Generalized Catalan Numbers
dc.typeBook
dc.typeThesis

Files

Collections

Texas A&M University at College Station