Search arXivSearch

arXiv · 2603.19194

Luck and magic for Pitman-Stanley polytopes and parking functions

Abstract

Motivated by the combinatorics of parking functions and their several generalizations, we study the Ehrhart theory of Pitman--Stanley polytopes. We prove a strong positivity phenomenon called \emph{magic positivity} for the Ehrhart polynomials of these polytopes, which in turn implies that their $h^*$-polynomials are real-rooted (and thus log-concave and unimodal). Our result is achieved by interpreting the coefficients of these Ehrhart polynomials in the \emph{magic basis} in terms of the number of \emph{lucky cars} in a modified parking protocol. Furthermore, we address the magic positivity problem for $\mathbf{y}$-generalized permutohedra and also discuss a \emph{magic} combinatorial interpretation for them, under the assumption that the input parameters are sufficiently large.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicolas Avila, Luis Ferroni, Alejandro H. Morales. 2026-04-08. Luck and magic for Pitman-Stanley polytopes and parking functions. https://arxiv.org/abs/2603.19194

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO