Fixed Points of Parking Functions

arXiv1901.02906MaRDI QIDQ6312232FDOQ6312232

Hugh Thomas, Jon McCammond, Nathan Williams

Publication date: 9 January 2019

Abstract: We define an action of words in $[m{]}^n$ on $mathbb{R}^m$ 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.

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10) Combinatorial identities, bijective combinatorics (05A19) Fixed points and coincidences in algebraic topology (55M20)

This page was built for publication: Fixed Points of Parking Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6312232)