2000 character limit reached
The Convex Hull of Parking Functions of Length $n$
Published 17 Apr 2021 in math.CO | (2104.08454v2)
Abstract: Let $\mathcal{P}_n$ be the convex hull in $\mathbb{R}n$ of all parking functions of length $n$. Stanley found the number of vertices and the number of facets of $\mathcal{P}_n$. Building upon these results, we determine the number of faces of arbitrary dimension, the volume, and the number of integer points of $\mathcal{P}_n$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.