English

Parking functions and {\L}ukasiewicz paths

Combinatorics 2024-11-08 v2

Abstract

We present a bijection between two well-known objects in the ubiquitous Catalan family: non-decreasing parking functions and {\L}ukasiewicz paths. This bijection maps the maximal displacement of a parking function to the height of the corresponding {\L}ukasiewicz path, and the total displacement to the area of the path. We also study this bijection restricted to two specific families of parking-functions: unit-interval parking functions, and prime parking functions.

Keywords

Cite

@article{arxiv.2403.17438,
  title  = {Parking functions and {\L}ukasiewicz paths},
  author = {Thomas Selig and Haoyue Zhu},
  journal= {arXiv preprint arXiv:2403.17438},
  year   = {2024}
}

Comments

11 pages, 5 figures. Comments welcome!

R2 v1 2026-06-28T15:33:45.347Z