Statistics on $\ell$-interval parking functions
Authors:
Preprint
Abstract
The displacement of a car with respect to a parking function is the number of spots it must drive past its preferred spot in order to park. An $\ell$-interval parking function is one in which each car has displacement at most $\ell$. Among our results, we enumerate $\ell$-interval parking functions with respect to statistics such as inversion, displacement, and major index. We show that $1$-interval parking functions with fixed displacement exhibit a cyclic sieving phenomenon. We give closed formulas for the number of $1$-interval parking functions with a fixed number of inversions. We prove that a well-known bijection of Foata preserves the set of $\ell$-interval parking functions exactly when $\ell\leq 2$ or $\ell\geq n-2$, which implies that the inversion and major index statistics are equidistributed in these cases.
Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Interval and $\ell$-interval Rational Parking FunctionsDiscrete Mathematics & Theoretical Computer Science, 2024
- Unit Interval Parking Functions and the r-Fubini NumbersLa Matematica, 2024
- Parking functions, Fubini rankings, and Boolean intervals in the weak order of $\mathfrak{S}_n$Journal of Combinatorics, 2024
- Interval parking functionsAdvances in Applied Mathematics, 2021
- Sequences, q-multinomial Identities, Integer Partitions with Kinds, and Generalized Galois NumbersThe PUMP Journal of Undergraduate Research, 2020
- Enumerating Parking Completions Using Join and SplitThe Electronic Journal of Combinatorics, 2020
- Morse Theory for Cell ComplexesAdvances in Mathematics, 1998
- Major Index and Inversion Number of PermutationsMathematische Nachrichten, 1978
- Mappings of acyclic and parking functionsAequationes mathematicae, 1974
- Two Applications of General Theorems in Combinatory Analysis: (1) To the Theory of Inversions of Permutations; (2) To the Ascertainment of the Numbers of Terms in the Development of a Determinant which has Amongst its Elements an Arbitrary Number of ZerosProceedings of the London Mathematical Society, 1917