Unit-Interval Parking Functions and the Permutohedron

Abstract

Unit-interval parking functions are subset of parking functions in which cars park at most one spot away from their preferred parking spot. In this paper, we characterize unit-interval parking functions by understanding how they decompose into prime parking functions and count unit-interval parking functions when exactly k<n cars do not park in their preference. This count yields an alternate proof of a result of Hadaway and Harris establishing that unit-interval parking functions are enumerated by the Fubini numbers. Then, our main result, establishes that for all integers 0≤ k<n, the unit-interval parking functions of length n with displacement k are in bijection with the k-dimensional faces of the permutohedron of order n. We conclude with some consequences of this result.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…