Parking Functions of Types A and B
نویسنده
چکیده
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parking functions. We use an analogous embedding for type B noncrossing partitions in order to answer a question raised by R. Stanley on the edge labeling of the type B non-crossing partitions lattice.
منابع مشابه
Autonomous Parallel Parking of a Car Based on Parking Space Detection and Fuzzy Controller
This paper develops an automatic parking algorithm based on a fuzzy logic controller with the vehicle pose for the input and the steering angle for the output. In this way some feasible reference trajectory path have been introduced according to geometric and kinematic constraints and nonholonomic constraints to simulate motion path of car. Also a novel method is used for parking space detec...
متن کاملPromoting city center parking qualities using urban design guidelines
Quality is the most important consequence of an urban design project, and its promotion is the final duty of an urban designer. So "urban design guidelines" which use environmental improvement factors in their structure, have an effective role in promoting urban space quality. "Urban design guidelines" are the most important instruments in urban designers' authority, to reflect and appear im...
متن کاملGeneralized Parking Functions, Tree Inversions and Multicolored Graphs
A generalized x-parking function associated to x = (a, b, b, . . . , b) ∈ Nn is a sequence (a1, a2, . . . , an) of positive integers whose non-decreasing rearrangement b1 ≤ b2 ≤ · · · ≤ bn satisfies bi ≤ a + (i − 1)b. The set of x-parking functions is equinumerate with the set of sequences of rooted b-forests on [n]. We construct a bijection between these two sets. We show that the sum enumerat...
متن کاملOn the Enumeration of Generalized Parking Functions
Let x = (x1, x2, . . . , xn) ∈ Nn . Define a x-parking function to be a sequence (a1, a2, . . . , an) of positive integers whose non-decreasing rearrangement b1 ≤ b2 ≤ · · · ≤ bn satisfies bi ≤ x1+ · · ·+xi. Let Pn(x) denote the number of x-parking functions. We discuss the enumerations of such generalized parking functions. In particular, We give the explicit formulas and present two proofs, o...
متن کاملParking functions and noncrossing partitions
A parking function is a sequence (a 1 ; : : : ; a n ) of positive integers such that if b 1 b 2 b n is the increasing rearrangement of a 1 ; : : : ; a n , then b i i. A noncrossing partition of the set [n] = f1; 2; : : : ; ng is a partition of the set [n] with the property that if a < b < c < d and some block B of contains both a and c, while some block B 0 of contains both b and d, then B = B ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 9 شماره
صفحات -
تاریخ انتشار 2002