REVIEW 2 major objections 4 minor 6 references
Eventually nondecreasing quasi-polynomials
T0 review · 2 major / 4 minor · reviewed 2026-08-01 · deepseek-v4-flash
Pith's one-line read This paper characterizes eventually nondecreasing quasi-polynomials by a finite list of moment-difference sign checks on their h-vectors, and describes the polyhedral geometry of this class.
desk verdict Strong, mostly correct paper with a false-but-repairable Lemma 5.4; the main results survive with revisions. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the h-vector h=(h_0,…,h_{p(d+1)}) of a quasi-polynomial, defined by the generating function Σ L_h(n) z^n = h(z)/(1−z^p)^{d+1}. The key identity expands L_h(tp+r) in the binomial basis binom{t+d−j}{d}; the coefficients are moments Σ_j (−j)^ℓ h_{r,j} (with (−j−1)^ℓ for the last residue). The difference L_h(n+1)−L_h(n) therefore has each constituent's leading coefficient proportional to the first nonvanishing moment difference A_r^(ℓ)(h) or B^(ℓ)(h) between adjacent residue classes. This identity converts the infinite family of inequalities L_h(n+1)≥L_h(n) into finitely many sign checks, and it is the reason the closure CEND is polyhedral.
What would settle it
Take the explicit h-vector from Example 4.3 and evaluate L_h(n) for n around 18 in exact arithmetic: the theorem predicts a single descent at n=18 and no others; any additional descent would disprove the realizability construction. Equivalently, search over all h-vectors with d=2, p=3 and compare the membership tests for C_0, C_1,... computed by brute force with the polyhedral description of Proposition 4.2; a mismatch would falsify the finite description.
Extended reading notes
Core claim
The central result (Theorem 3.1) states that an h-vector h belongs to the eventually nondecreasing cone C_END exactly when, for each residue r between 0 and p−2, either all moment differences A_r^(ℓ)(h)=Σ_j(−j)^ℓ h_{r+1,j} − Σ_j(−j)^ℓ h_{r,j} vanish, or the first nonvanishing one is positive, and similarly for the wrap-around quantity B^(ℓ)(h) involving residues p−1 and 0. These moment differences control the leading coefficients of the constituents of L_h(n+1)−L_h(n), so the condition says exactly that each constituent is eventually nonnegative. A direct corollary is that the closure CEND is the polyhedral cone defined by the volume equalities (the total sums of adjacent residue classes agr
Load-bearing premise
The characterization assumes the h-vector encoding of quasi-polynomials is complete and faithful—that every degree-d, period-p quasi-polynomial corresponds to exactly one such vector—and the non-polyhedrality claim additionally relies on the realizability lemma that any zero-sum family of difference polynomials can be realized by an h-vector.
Editorial extensions
If this is right
- For fixed d and p, checking whether a quasi-polynomial is eventually nondecreasing requires only computing the first d+1 moment differences for each residue—a finite linear algebra calculation.
- Optimization over the eventually nondecreasing cone (e.g., extremal h-vectors) becomes a linear program, since the closure is polyhedral with explicit inequalities.
- For degree 1 and 2 the cone C_N (nondecreasing from step N) is polyhedral, so eventual nondecreasing can be certified by checking one period's worth of values; for degree ≥3 it cannot, as single decreases may be placed arbitrarily far out.
- The nonnegative part of the closure has vertices with an explicit combinatorial form—each residue class is either a unit mass or two masses straddling an integer center-of-mass—so all ray generators are known.
- The number of nonnegative integer h-vectors of volume V in the eventually nondecreasing cone grows as a quasi-polynomial of degree pd, meaning the enumeration has a closed quasi-polynomial form.
Reading between the lines
- The moment-difference condition is a kind of stochastic monotonicity test: if one treats each residue class of the h-vector as a probability distribution (after normalizing volume), the condition says the first moment that distinguishes two adjacent classes must be ordered in a fixed direction. This suggests the result may transfer to problems about comparing distributions (e.g., stochastic domina
- The conservation of volume across residue classes is a strong constraint; I suspect it corresponds to a known invariant in Ehrhart theory, and the first-level inequalities might encode a mean-width condition for the associated lattice polytope, which could give a geometric reinterpretation of eventual monotonicity.
- The non-polyhedrality for d≥3 implies that any algorithm deciding C_N membership for a fixed N must inspect infinitely many inequalities, which may explain why no simple local monotonicity criterion was known before; a testable consequence is that the cone C_N has infinitely many facets, which one could verify by computing the polar cone for small d=3, p=2.
- A concrete extension would be to compute the moment differences for Ehrhart series of rational polytopes and check whether the sign pattern correlates with known monotonicity/unimodality results for Ehrhart h*-vectors; if so, Theorem 3.1 would give a new unified proof of such results.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies quasi-polynomials of degree d and period dividing p, encoded by h-vectors in R^{p(d+1)}, and characterizes those that are eventually nondecreasing. Theorem 3.1 reduces the infinite family of inequalities L_h(n+1) >= L_h(n) to finitely many sign conditions on certain moment differences A_r^(ell)(h) and B^(ell)(h). The closure of the eventually nondecreasing cone is shown to be a polyhedral cone (Cor. 3.5), while C_N is polyhedral exactly for d=1,2 (Thm. 4.6). The paper then restricts to nonnegative h-vectors, studies the polytope S_1, and classifies its vertices (Thm. 5.3). Section 6 gives sufficient criteria for a vertex to lie in C_END. Section 7 proves that the number of nonnegative integer h-vectors of volume V that are eventually nondecreasing is a quasipolynomial in V of degree pd (Thm. 7.2), with explicit generating functions for small parameters.
Significance. If the results hold, the paper gives a clean finite characterization of eventual nondecreasingness for quasi-polynomials, a structural dichotomy for the cones C_N, a full vertex description of the nonnegative part of the closure, and a quasipolynomial growth result. The paper is largely self-contained, provides detailed proofs, and includes several worked examples and explicit SageMath-generated generating functions. These are substantial contributions to the study of quasi-polynomial h-vectors.
major comments (2)
- [§5, Lemma 5.4] Lemma 5.4 is false as stated. For d=4, p=3, take v=(1/2,0,1/2,0,0 | 0,1,0,0,0 | 0,1,0,0,0) and w=(0,1,0,0,0 | 0,1,0,0,0 | 0,1,0,0,0). Both lie in S_1 (nonnegative, volume equalities, first-level inequalities) and both have at most two nonzero entries in each mod class, and CM(v)=CM(w)=(1,1,1), yet v≠w. The proof of Lemma 5.4 solves (5.3) only after fixing the support pair (α,ω); CM alone does not determine that support. This false lemma is used in the reverse direction of Theorem 5.3 to conclude w=v from CM(w)=CM(v), and in Proposition 8.3 to construct v_i with the same zero pattern as h. In those particular uses the zero pattern is fixed by the facet equations, so the intended argument is likely salvageable by restating Lemma 5.4 with an explicit support hypothesis, but the current statement and proof are overstrong and the written proof of Theorem 5.3 relies on them.
- [§8, Lemma 8.7 and Prop. 8.3] Lemma 8.7 is false as stated. For p=2, CM=(1.8,1.2) satisfies (5.1), since -1+1.8=0.8 ≤ 1.2 ≤ 1.8. The lemma prescribes s=p-1=1 and, after deleting integer coordinates, the ordered list (s_1)=(0). Thus g^(1) rounds down coordinate 0 and up coordinate 1, giving (1,2), which violates (5.1) because 2≤1 is false. Rounding down coordinate 1 instead yields (2,1), which satisfies (5.1). Hence the columns g^(i) in Proposition 8.3 are not always in CEND, so the decomposition argument in Proposition 8.3 has a real gap. For the vertex classification this case may be excluded by Lemma 8.1 when max(h)<1, but the stated lemma and proposition are not correct and need an added hypothesis or a refined case division.
minor comments (4)
- [§3, Cor. 3.2] The chamber decomposition does not handle the case a_r=d (or b=d) where A^(a_r+1)_r or B^(b+1) is not defined. If all A^(ℓ)_r vanish for ℓ=0,...,d, the intended cell should be included as an all-vanishing relative-open cone. This is a small but necessary clarification for the union decomposition used later in Section 7.
- [§7, Thm. 7.2 proof] In the proof, the function gnd(p,d;V) is written instead of gnd(d,p;V). This is a typo, but it should be corrected.
- [§7, Example 7.4] In the d=3, p=2 rational generating function, the expression contains an extra parenthesis: '... + 3t + 1))/' appears to have one unmatched ')'.
- [§5, Lemma 5.4 proof] The proof would be clearer if it explicitly states that the support (α,ω) is assumed fixed when solving the two equations; as written, the uniqueness assertion is the source of the error described in the major comments.
Circularity Check
No significant circularity; the paper's derivation chain is self-contained.
full rationale
The paper's central characterization (Theorem 3.1) is derived directly from the definition of the h-vector encoding and the quasi-polynomial constituents, via an explicit binomial-basis expansion; it does not assume the eventual-nondecreasing conclusion. The cone constructions, volume equalities, and first-level inequalities are all defined in terms of h and then related by proved equivalences. Section 4 constructs witness vectors from prescribed difference polynomials using Lemmas 4.4 and 4.5; the construction is explicit and the total-sum condition is derived, not imposed as the desired conclusion. Section 5's enumeration and vertex analysis are built on these proved characterizations, and the computational statements are checked against Ehrhart theory rather than being fitted to the target counts. The only self-citation, reference [2], appears in Remark 5.2 as background on finite probability distributions in Ehrhart theory and is not used as an input to any theorem. The mathematical concerns raised about Lemma 5.4 and Lemma 8.7 are potential correctness gaps, not circularity: an overstrong or false lemma is not an instance of a prediction being equivalent to its input. No parameter is fitted and then renamed as a prediction, and no load-bearing claim is justified solely by a self-citation. Thus the circularity score is 0.
Assumptions & free parameters
assumptions (4)
- domain assumption Every quasi-polynomial of degree ≤ d and period dividing p can be uniquely encoded as h(z)/(1-z^p)^(d+1) with h-vector of length p(d+1).
- standard math A real polynomial is eventually nonnegative if and only if its leading coefficient is positive (or the polynomial is identically zero).
- standard math Ehrhart theory: for a rational polytope P of dimension n, the count of lattice points in V·P is a quasi-polynomial of degree n with period dividing the lcm of vertex denominators, including Ehrhart-MacDonald reciprocity for open/partially-open polytopes.
- standard math Elementary symmetric polynomial identities and binomial identities used to expand binomial(t+d-j, d) in the monomial basis t^{d-k}.
Cite this review
Pith. "Pith review of Eventually nondecreasing quasi-polynomials." pith.science (2026). https://pith.science/paper/632AQOOY
@misc{pith2026260719207,
author = {Pith},
title = {Pith review of: Eventually nondecreasing quasi-polynomials},
year = {2026},
howpublished = {\url{https://pith.science/paper/632AQOOY}},
note = {Machine review of arXiv:2607.19207}
}
abstract
Quasi-polynomials are ubiquitous in combinatorics and algebra, as they arise in a variety of enumeration problems. Because quasi-polynomials consist of constituent polynomials, their behavior is more subtle than for a single polynomial. In particular, unlike for a polynomial, it is possible for a quasi-polynomial defined on the positive integers to have infinitely many points at which it is decreasing. In this work, we characterize quasi-polynomials of degree $d$ and period dividing $p$ that are eventually nondecreasing, i.e., that have only finitely many values at which they decrease. We then give a detailed analysis of the space of eventually nondecreasing quasi-polynomials with fixed degree $d$ and period dividing a fixed $p$ such that the $h$-vector of the quasi-polynomial is nonnegative. Using this analysis, we determine the rate of growth of the number of such quasi-polynomials as a function of the sum of the $h$-vector entries for the $0$-th constituent polynomial.
Reference graph
Works this paper leans on
-
[1]
Bogart, J
T. Bogart, J. Goodrick, and K. Woods,Parametric Presburger arithmetic: logic, combina- torics, and quasi-polynomial behavior, Discrete Analysis 4 (2017), 34 pp
2017
- [2]
-
[3]
Bruns and J
W. Bruns and J. Herzog,Cohen-Macaulay rings, Cambridge Studies in Advanced Mathematics, 39, Cambridge Univ. Press, Cambridge, 1993
1993
-
[4]
Beck and S
M. Beck and S. Robins,Computing the Continuously Discretely: Integer-Point Enumeration in Polyhedra, Springer New York, New York, 2015
2015
-
[5]
Rosales and P
J. Rosales and P. Garc ´ ıa-S´ anchez,Numerical Semigroups, Developments in Mathematics, Vol. 20, Springer-Verlag, New York, 2009. EVENTUALLY NONDECREASING QUASI-POLYNOMIALS 31
2009
-
[6]
K. M. Woods,The unreasonable ubiquitousness of quasi-polynomials, Electron. J. Combin. Vol. 21 (2014), no. 1, Paper 1.44, 23 pp. Mathematics Department, University of Kentucky, Lexington, KY 40506 Email address:benjamin.braun@uky.edu Mathematics Department, San Diego State University, San Diego, CA 92182 Email address:cdoneill@sdsu.edu Mathematics Departm...
2014
Reviewed August 1, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.