arxiv: 2603.19194 · v2 · submitted 2026-03-19 · 🧮 math.CO

Recognition: 2 theorem links

· Lean Theorem

Luck and magic for Pitman-Stanley polytopes and parking functions

Nicolas Avila , Luis Ferroni , Alejandro H. Morales

Authors on Pith no claims yet

Pith reviewed 2026-05-15 07:56 UTC · model grok-4.3

classification 🧮 math.CO

keywords Pitman-Stanley polytopesparking functionsEhrhart polynomialsmagic positivityh-star polynomialsreal-rootednesslucky cars

0 comments

The pith

Pitman-Stanley polytopes exhibit magic positivity in their Ehrhart polynomials through counts of lucky cars in a parking protocol.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes magic positivity for the Ehrhart polynomials of Pitman-Stanley polytopes by linking their coefficients in the magic basis to the number of lucky cars in a modified parking protocol. This positivity ensures that the associated h*-polynomials are real-rooted, and therefore also log-concave and unimodal. The result extends to y-generalized permutohedra when the defining parameters are large enough, again using a combinatorial interpretation in terms of lucky cars.

Core claim

We prove a strong positivity phenomenon called 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 magic basis in terms of the number of lucky cars in a modified parking protocol. Furthermore, we address the magic positivity problem for y-generalized permutohedra and also discuss a magic combinatorial interpretation for them, under the assumption that the input parameters are sufficiently large.

What carries the argument

The magic basis, in which the Ehrhart polynomial coefficients count lucky cars under a modified parking protocol for Pitman-Stanley polytopes.

Load-bearing premise

The input parameters must be sufficiently large to guarantee magic positivity for y-generalized permutohedra.

What would settle it

A specific set of small parameters for a y-generalized permutohedron where some coefficient in the magic basis is negative would disprove the general claim.

read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Avila, Ferroni, and Morales establish magic positivity for Pitman-Stanley polytopes through a lucky cars counting argument in parking functions.

read the letter

The punchline is that this paper establishes magic positivity for the Ehrhart polynomials of Pitman-Stanley polytopes by interpreting their coefficients in the magic basis as the number of lucky cars in a modified parking protocol. This combinatorial count is non-negative for all inputs in the main case, which immediately yields real-rooted h*-polynomials and the usual consequences like log-concavity and unimodality. What the authors do well is connect the polytope theory directly to the parking functions combinatorics in a way that makes the positivity obvious from the counting. The lucky cars idea seems fresh and provides an explicit model that readers can verify by hand for small cases. It builds on prior work on these polytopes without overclaiming, and the proof strategy is straightforward once the protocol is defined. The soft spot is in the y-generalized permutohedra section, where the magic positivity holds only when the parameters are large enough. This is presented as an additional discussion rather than the core result, but it does leave open whether a uniform statement exists without that restriction. No other major issues stand out from the description; the main argument avoids circularity by grounding everything in the independent counting. This work is for combinatorialists working on Ehrhart theory, positivity in polytopes, and generalizations of parking functions. Someone who has seen the standard Pitman-Stanley results will appreciate how the new interpretation strengthens the positivity tools without introducing new machinery. The math and citations look clean, with no signs of post-hoc fitting. I would bring it to the next reading group to go through the definition of lucky cars and check a small example. Recommendation: send it to peer review. It is a focused, grounded contribution that merits referee input on the details of the generalized case.

Referee Report

0 major / 3 minor

Summary. The paper proves a strong positivity phenomenon called magic positivity for the Ehrhart polynomials of Pitman-Stanley polytopes by interpreting their coefficients in the magic basis as the number of lucky cars under a modified parking protocol. This combinatorial count establishes non-negativity directly and implies that the h*-polynomials are real-rooted (hence log-concave and unimodal). The work also discusses an analogous magic combinatorial interpretation for y-generalized permutohedra, subject to the assumption that input parameters are sufficiently large.

Significance. If the combinatorial interpretation holds, the result supplies an explicit non-negative counting argument for Ehrhart coefficients in the magic basis, yielding real-rootedness of the h*-polynomials without analytic conditions. This strengthens the link between parking functions and Ehrhart theory of generalized permutohedra and provides a direct, manifestly integral grounding for the positivity claims.

minor comments (3)

The assumption that input parameters are 'sufficiently large' for the y-generalized permutohedra case should be made precise by stating an explicit lower bound or condition on the parameters, as this is needed for the combinatorial interpretation to apply.
Include a brief self-contained definition or diagram of the modified parking protocol and the 'lucky cars' counting rule in the main text (near the statement of the main theorem) to make the combinatorial argument accessible without requiring external references.
Verify and state explicitly that the magic basis expansion is unique and that the coefficient extraction is well-defined for all degrees of the Ehrhart polynomial.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment and recommendation of minor revision. The report accurately summarizes our main results on magic positivity for the Ehrhart polynomials of Pitman-Stanley polytopes via the lucky cars interpretation, the resulting real-rootedness of the h*-polynomials, and the extension to y-generalized permutohedra for large parameters. We appreciate the recognition of the combinatorial link to parking functions and Ehrhart theory.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper derives magic positivity for the Ehrhart polynomials of Pitman-Stanley polytopes by equating their coefficients in the magic basis to the number of lucky cars in a modified parking protocol. This is a direct, manifestly non-negative combinatorial count that does not reduce to any fitted parameter or self-referential definition. Real-rootedness of the h*-polynomials follows from the standard implication of magic positivity, with no load-bearing self-citations or ansatz smuggling required. The y-generalized permutohedra discussion is explicitly conditional on large parameters and is not part of the central theorem.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 2 invented entities

Only the abstract is available, so the ledger records the background notions invoked there.

axioms (1)

standard math Ehrhart polynomials admit an h*-polynomial expansion whose coefficients determine real-rootedness when positive in a suitable basis
Invoked to conclude real-rootedness, log-concavity and unimodality from magic positivity

invented entities (2)

magic basis no independent evidence
purpose: Basis in which Ehrhart coefficients become manifestly non-negative
New basis introduced to capture the positivity phenomenon
lucky cars no independent evidence
purpose: Combinatorial objects whose count equals the magic-basis coefficients
Defined via a modified parking protocol

pith-pipeline@v0.9.0 · 5434 in / 1340 out tokens · 30675 ms · 2026-05-15T07:56:47.919245+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We prove a strong positivity phenomenon called magic positivity for the Ehrhart polynomials of these polytopes, which in turn implies that their h*-polynomials are real-rooted... by interpreting the coefficients... in terms of the number of lucky cars in a modified parking protocol.
IndisputableMonolith/Foundation/ArithmeticFromLogic.lean LogicNat_equiv_Nat unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 1.1... n!·ci enumerates the y-parking functions having exactly i lucky cars without the first available space.

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.