On the enumeration of generalized parking functions
A generalized parking function is defined as follows: let \(\vec {x}=(x_1,\ldots,x_n) \in \mathbb{N} ^n\) be a vector of positive integers. Then an \(\vec x\)-parking function is a sequence \((a_1,\ldots,a_n)\) of positive integers whose non-decreasing rearrengment \(b_1 \leq \ldots \leq b_n\) satisfies \(b_i \leq x_1 + \cdots + x_i.\) The case \(x_i=1\) for all \(i\) supplies the notion of parking function introduced in 1966 by Konheim and Weiss in connection of occupancy problems in computer science. The number of generalized parking functions got quite an attention recently, but it is far from a complete solution. This paper solves far-reaching special cases by means of combinatorial arguments as well as of the generating function method.
- Parking functions
- On the enumeration of parking functions by leading terms
- Generalized parking functions, tree inversions, and multicolored graphs
- Vector parking functions with periodic boundaries and rational parking functions
- Non-commutative Frobenius characteristic of generalized parking functions. Application to enumeration
- Expected sums of general parking functions
- Monomial ideals induced by permutations avoiding patterns
- Combinatorics of \(q\), \(t\)-parking functions
- Enumeration of \((p,q)\)-parking functions
- Gončarov polynomials and parking functions
- Orientations, semiorders, arrangements, and parking functions
- Bijections on \(r\)-Shi and \(r\)-Catalan arrangements
- Integer sequences and monomial ideals
- U-parking functions and (p,q)-parking functions
- Standard monomials of 1-skeleton ideals of graphs and generalized signless Laplacians
- Enumerating parking completions using join and split
- An experimental mathematics approach to the area statistic of parking functions
- Volumes and Ehrhart polynomials of flow polytopes
- The number of parking functions with center of a given length
- Extending the parking space
- A three shuffle case of the compositional parking function conjecture
- Alexander duals of multipermutohedron ideals
- On the enumeration of parking functions by leading terms
- Skeleton ideals of certain graphs, standard monomials and spherical parking functions
- A symmetry on parking functions via Dyck paths
- Non-commutative Frobenius characteristic of generalized parking functions. Application to enumeration
- Affine permutations and rational slope parking functions
- Parking functions
- Parking functions and tree inversions revisited
- Certain variants of multipermutohedron ideals
- Descents in parking functions
- Bivariate Gončarov polynomials and integer sequences
- Trees, parking functions, syzygies, and deformations of monomial ideals
- A simpler formula for the number of diagonal inversions of an \((m, n)\)-parking function and a returning fermionic formula
- On increasing and invariant parking sequences
- Trees, parking functions, and standard monomials of skeleton ideals
- A combinatorial model for computing volumes of flow polytopes
- Subset parking functions
- Parking cars after a trailer
- From parking functions to Gelfand pairs.
- Steck determinants and parking functions
- Generalized parking functions, tree inversions, and multicolored graphs
- The convex hull of parking functions of length n
- Parking functions, multi-shuffle, and asymptotic phenomena
- On Parking Functions and The Tower of Hanoi
- Generalized parking function polytopes
- Primeness of generalized parking functions
- Some aspects of (r,k)-parking functions
- Combinatorics of generalized parking-function polytopes
- Parking functions on nonsingular \(M\)-matrices
This page was built for publication: On the enumeration of generalized parking functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2716644)