English

Statistics on $\ell$-interval parking functions

Combinatorics 2025-07-11 v1

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 11-interval parking functions with fixed displacement exhibit a cyclic sieving phenomenon. We give closed formulas for the number of 11-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 2\ell\leq 2 or n2\ell\geq n-2, which implies that the inversion and major index statistics are equidistributed in these cases.

Cite

@article{arxiv.2507.07243,
  title  = {Statistics on $\ell$-interval parking functions},
  author = {Kyle Celano and Jennifer Elder and Kimberly P. Hadaway and Pamela E. Harris and Jeremy L. Martin and Amanda Priestley and Gabe Udell},
  journal= {arXiv preprint arXiv:2507.07243},
  year   = {2025}
}

Comments

25 pages

R2 v1 2026-07-01T03:53:53.523Z