The Convex Hull of Parking Functions of Length $n$
Aruzhan Amanbayeva, Danielle Wang

TL;DR
This paper investigates the geometric properties of the convex hull of parking functions, providing explicit formulas for faces, volume, and lattice points, extending Stanley’s foundational results.
Contribution
It advances the understanding of the convex hull of parking functions by deriving formulas for faces, volume, and integer points, building on previous vertex and facet counts.
Findings
Derived formulas for the number of faces of all dimensions
Calculated the volume of the convex hull
Counted the integer lattice points within the convex hull
Abstract
Let be the convex hull in of all parking functions of length . Stanley found the number of vertices and the number of facets of . Building upon these results, we determine the number of faces of arbitrary dimension, the volume, and the number of integer points of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Point processes and geometric inequalities · Mathematical Dynamics and Fractals
