A Closer Look at Chapoton's q-Ehrhart Polynomials

Matthias Beck; Thomas Kunze

arxiv: 2505.22900 · v2 · submitted 2025-05-28 · 🧮 math.CO

A Closer Look at Chapoton's q-Ehrhart Polynomials

Matthias Beck , Thomas Kunze This is my paper

Pith reviewed 2026-05-19 12:02 UTC · model grok-4.3

classification 🧮 math.CO

keywords q-Ehrhart polynomialsBrion's theoremlattice polytopesrational polytopesvertex conesrefined enumerationEhrhart theory

0 comments

The pith

Brion's theorem on vertex cones yields explicit formulas for Chapoton's q-Ehrhart polynomials and extends the results to rational polytopes.

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

The paper shows that Chapoton's refined counting polynomial, which tracks lattice points in a dilated polytope with weights from a fixed linear form, arises naturally when Brion's theorem decomposes the polytope into its vertex cones. This decomposition produces concrete expressions for the full polynomial, its highest-degree coefficient, and its growth as the dilation parameter becomes large. The same cone-based approach carries over to give structural and reciprocity properties when the polytope is allowed to have rational rather than integer vertices. A reader would care because the viewpoint unifies two standard tools and widens the setting in which the q-refinement can be computed and applied.

Core claim

For a lattice polytope P and integral linear form λ the sum over points m in tP of q raised to λ(m) equals the evaluation of a polynomial cha_P^λ(q,x) at the q-integer [t]_q, and Brion's theorem expresses this polynomial explicitly as a sum of contributions coming from the vertex cones of P.

What carries the argument

Brion's theorem decomposing the integer-point generating function of a polytope into a signed sum over the generating functions of its vertex cones.

If this is right

The polynomial cha_P^λ(q,x) admits an explicit expression in terms of the vertex cones.
Its leading coefficient can be written down directly from the same cone data.
The asymptotic behavior for large t follows immediately from the cone contributions.
Structural and reciprocity theorems for the q-polynomial continue to hold when P is replaced by a rational polytope.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The cone decomposition might supply closed forms for other weighted Ehrhart functions that currently lack them.
Similar refinements could be tested on polytopes with additional symmetry constraints or on families such as cyclic polytopes.
The explicit leading-term formula opens the possibility of comparing growth rates across different choices of the weight λ.

Load-bearing premise

Brion's theorem applies directly to the q-weighted generating functions without further compatibility requirements between the linear form and the cone decompositions.

What would settle it

Compute the refined point count for a concrete lattice polytope and linear form λ at several values of t, then check whether it matches the explicit formula obtained by summing the q-weighted contributions of the vertex cones.

read the original abstract

If $\mathcal{P}$ is a lattice polytope (i.e., $\mathcal{P}$ is the convex hull of finitely many integer points in $\mathbb{R}^d$), Ehrhart's famous theorem (1962) asserts that the integer-point counting function $|t \mathcal{P} \cap \mathbb{Z}^d|$ is a polynomial in the integer variable $t$. Chapoton (2016) proved that, given a fixed integral form $\lambda: \mathbb{Z}^d \to \mathbb{Z}$, there exists a polynomial $\text{cha}_\mathcal{P}^\lambda(q,x) \in \mathbb{Q}(q)[x]$ such that the refined enumeration function $\sum_{ \mathbf{m} \in t \mathcal{P} } q^{ \lambda(\mathbf{m}) }$ equals the evaluation $\text{cha}_\mathcal{P}^\lambda (q, [t]_q)$ where, as usual, $[t]_q := \frac{ q^t - 1 }{ q-1 }$; naturally, for $q=1$ we recover the Ehrhart polynomial. Our motivating goal is to view Chapoton's work through the lens of Brion's Theorem (1988), which expresses the integer-point structure of a given polytope via that of its vertex cones. It turns out that this viewpoint naturally yields various refinements and extensions of Chapoton's results, including explicit formulas for $\text{cha}_\mathcal{P}^\lambda(q,x)$, its leading coefficient, and its behavior as $t \to \infty$. We also prove an analogue of Chapoton's structural and reciprocity theorems for rational polytopes (i.e., with vertices in $\mathbb{Q}^d$).

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

Brion's theorem applied to the q-refined count yields explicit formulas for Chapoton's polynomials plus rational-polytope extensions, though the compatibility step for λ needs checking.

read the letter

This paper shows that Brion's theorem applied to the q-refined point count gives explicit formulas for the Chapoton polynomial cha_P^λ(q,x), including its leading term and large-t behavior. It also carries the structural and reciprocity theorems over to rational polytopes. The explicit formulas are the real addition. Chapoton proved existence; here the authors extract closed forms by summing over the vertex cones. That is a useful step for anyone who wants to compute these things or study their properties further. The rational-polytope version broadens the scope without much extra work. The viewpoint is honest and incremental. It does not claim to invent new phenomena but rather to make existing ones more explicit through a standard decomposition. One place to watch is the compatibility of the linear form λ with the cone rays. Brion's theorem splits the generating function into local contributions at each vertex, but inserting q^λ(m) requires that the exponent behaves well under the translation or the semigroup structure in each cone. The abstract treats this as automatic, yet a referee will want to see the precise statement of how λ interacts with the supporting functionals. For readers in combinatorial geometry who follow Ehrhart theory and its q-variants, this is a natural next paper. It deserves a serious referee because the claims rest on two solid prior results and the new output is concrete.

Referee Report

1 major / 0 minor

Summary. The manuscript claims that viewing Chapoton's q-Ehrhart polynomials through Brion's theorem on vertex cones naturally yields explicit formulas for cha_P^λ(q,x) (including its leading coefficient and asymptotic behavior as t → ∞), along with analogues of Chapoton's structural and reciprocity theorems that extend to rational polytopes.

Significance. If established, the results would provide a useful new viewpoint that refines and generalizes Chapoton's 2016 work by leveraging Brion's 1988 theorem, offering explicit expressions and broader applicability to rational polytopes in q-refined Ehrhart theory.

major comments (1)

[Abstract] Abstract: The motivating claim that Brion's theorem applies directly to produce the q-refined formulas and extensions assumes compatibility between the linear form λ and the vertex cone decompositions when refining the generating function ∑ q^{λ(m)}. The abstract provides no indication that this compatibility is established or holds without extra conditions, which is load-bearing for the central derivations.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback on our manuscript. We address the major comment below and are happy to revise the abstract for greater clarity while preserving the accuracy of our claims.

read point-by-point responses

Referee: [Abstract] Abstract: The motivating claim that Brion's theorem applies directly to produce the q-refined formulas and extensions assumes compatibility between the linear form λ and the vertex cone decompositions when refining the generating function ∑ q^{λ(m)}. The abstract provides no indication that this compatibility is established or holds without extra conditions, which is load-bearing for the central derivations.

Authors: We agree that the abstract would benefit from greater explicitness on this point. In the body of the manuscript we prove that Brion's theorem extends directly to the refined generating function ∑ q^{λ(m)} for any integral linear form λ: the decomposition into vertex cones is compatible because λ is linear, so the exponent λ(m) factors additively over the translated cones without requiring further restrictions or extra conditions on λ beyond integrality. The explicit formulas, leading coefficient, and asymptotic results all follow from this decomposition. To address the referee's concern we will revise the abstract to state explicitly that the results hold for any integral linear form λ, with the compatibility following immediately from linearity and the statement of Brion's theorem (as shown in Section 2). revision: yes

Circularity Check

0 steps flagged

No circularity: viewpoint applies independent external theorems to derive extensions

full rationale

The abstract presents the work as applying Brion's theorem (1988) to Chapoton's q-Ehrhart polynomials (2016) to obtain refinements such as explicit formulas for cha_P^λ(q,x), its leading coefficient, asymptotic behavior as t→∞, and analogues of structural and reciprocity theorems for rational polytopes. These are described as natural consequences of the new viewpoint without any equations or definitions that reduce the claimed results to the inputs by construction. The cited results are from independent prior authors and years, with no self-citation load-bearing, no fitted parameters presented as predictions, and no ansatz or renaming that collapses the derivation. The chain is self-contained as a genuine application yielding new content.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claims rest on standard results from polytope theory without introducing new free parameters or invented entities.

axioms (1)

domain assumption Brion's theorem expresses the integer-point structure of a polytope via its vertex cones.
Invoked as the lens through which Chapoton's q-Ehrhart results are refined and extended.

pith-pipeline@v0.9.0 · 5807 in / 1362 out tokens · 43858 ms · 2026-05-19T12:02:46.988009+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.AbsoluteFloorClosure reality_from_one_distinction unclear

?

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

Chapoton (2016) proved that, given a fixed integral form λ: ℤ^d → ℤ, there exists a polynomial cha_P^λ(q,x) ∈ ℚ(q)[x] such that the refined enumeration function ∑_{m ∈ tP} q^{λ(m)} equals the evaluation cha_P^λ(q, [t]_q)
IndisputableMonolith.Cost.FunctionalEquation washburn_uniqueness_aczel unclear

?

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

view Chapoton's work through the lens of Brion's Theorem (1988), which expresses the integer-point structure of a given polytope via that of its vertex cones

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.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

A geometric and generating function approach to plethysm
math.CO 2025-11 unverdicted novelty 6.0

A bivariate generating function for plethysm coefficients with bounded length(λ) is rational; for length 2 an explicit geometric algorithm exists via q-Ehrhart theory, plus linear recursions for the SL2 case.