Fixed Points of Parking Functions
Abstract
We define an action of words in [m]n on Rm to give a new characterization of rational parking functions -- they are exactly those words whose action has a fixed point. We use this viewpoint to give a simple definition of Gorsky, Mazin, and Vazirani's zeta map on rational parking functions when m and n are coprime, and prove that this zeta map is invertible. A specialization recovers Loehr and Warrington's sweep map on rational Dyck paths.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.