Pith. sign in

REVIEW 4 major objections 5 minor 17 references

Chow polynomials of simplicial posets with positive $h$-vector are real-rooted

T0 review · 4 major / 5 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Simplicial posets with positive h-vector have real-rooted Chow and augmented Chow polynomials.

desk verdict Settles a conjecture for simplicial Cohen-Macaulay posets with a genuinely new interlacing argument; the local typos are cosmetic. read the letter →

arxiv 2508.15538 v1 pith:IXTTVQAI submitted 2025-08-21 math.CO

Elena Hoster , Christian Stump This is my paper · ORCID
classification math.CO MSC 05A2006A0705A15
keywords Chowpolynomialsimplicialposetreal-rootedh-vectorinterlacinggamma-expansionCohen-Macaulayflag
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper proves a structural theorem in enumerative combinatorics: if a finite graded simplicial poset has an $h$-vector with no negative entries, then the Chow polynomial and augmented Chow polynomial of the poset with a top element added are real-rooted, meaning all their roots lie on the real line. Real-rootedness is the strongest common form of log-concavity for such polynomials, and it is what many positivity conjectures in matroid theory reduce to. The result settles the known conjecture on Cohen–Macaulay simplicial posets and their duals, and it recovers, in one stroke, previously proved real-rootedness results for uniform matroids. A sympathetic reader should care because the proof introduces a family of permutation-descent polynomials whose interlacing structure is flexible enough to yield the result from the $h$-vector alone.

What carries the argument

The load-bearing object is the family $p^T_{n,k}(x)$ of polynomials that count permutations $w\in S_{n+1}$ with $w(1)=k+1$ and descent set an isolated set inside $T$. Equation (1.3) expresses the flag $h$-vector $\beta$ of a simplicial poset through these counts, making each Chow $\gamma$-polynomial a nonnegative linear combination of one row of the interlacing diagram. Theorem 3.3 asserts that, for $T=[1,n]$ or $T=[1,n-1]$, the three-row diagram built from $p^{T\setminus\{1\}}_{n,k}$, $p^T_{n,k}$, $p^{\{1\}\subseteq T}_{n,k}$ is interlacing; this is what converts a coordinate-wise positivity assumption (the $h$-vector) into a root-location conclusion.

What would settle it

Compute the Chow polynomial $H_{\hat{P}}(x)$ of any finite graded simplicial poset with nonnegative $h$-vector—for instance the lattice of flats of the uniform matroid $U_{5,8}$ with its top element attached—and test every root for being real; a single non-real root would contradict Theorem 1.1.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.1: for a finite graded simplicial poset $P$ with positive $h$-vector, both $H_{\hat{P}}(x)$ and $H^{\mathrm{aug}}_{\hat{P}}(x)$ are real-rooted. The proof works by rewriting the flag $h$-vector of $\hat{P}$ with the identity relating $\beta$ to the $h$-vector and to permutation descent sets, so that each $\gamma$-polynomial of the Chow-type polynomials becomes a nonnegative combination of polynomials $p^T_{n,k}$ counting permutations with prescribed descent sets. The technical heart is Theorem 3.3, an interlacing diagram for these $p$-polynomials: every path through the diagram is an interlacing sequence, and hence every nonnegative linear combination is real-rooted. Passing from $\gamma$-polynomials back to the or

Load-bearing premise

The load-bearing premise is that the $h$-vector has no negative entries; without it, the proof's nonnegative linear combinations of interlacing polynomials are not guaranteed real-rooted.

Editorial extensions

If this is right

  • The conjecture that Cohen–Macaulay posets have real-rooted Chow polynomials is proved in the simplicial case, since Cohen–Macaulay simplicial posets are h-positive.
  • The dual variant gives an interlacing statement between the Chow polynomial of a dual poset and the augmented Chow polynomial of the original, for this class.
  • For uniform matroids, the theorem recovers real-rootedness of both Chow and augmented Chow polynomials as special cases.
  • For the Boolean lattice, the decomposition of the Eulerian and binomial Eulerian polynomials into interlacing palindromic summands yields an alternative proof of their real-rootedness.
  • The same interlacing diagram supplies real-rootedness for any nonnegative h-vector, not just those coming from Cohen–Macaulay posets.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper leaves open whether real-rootedness persists without h-positivity; the conjecture in the paper suggests one should search for a simplicial poset with a negative h-vector entry whose Chow polynomial still has only real roots.
  • Because the proof is purely a property of permutation-descent interlacing, one can test whether analogous interlacing diagrams exist for other flag-like invariants of matroids, which would yield real-rootedness by the same mechanism.
  • A natural extension is to replace the nonnegative h-vector assumption with log-concavity or gamma-positivity of the h-vector; the interlacing machinery would remain applicable as long as the coefficients in the linear combination stay nonnegative.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper proves Theorem 1.1: for every finite graded simplicial poset P with positive h-vector, the Chow and augmented Chow polynomials of \hat P are real-rooted; Theorem 1.2 adds that for the dual poset \hat P^*, the Chow polynomial is real-rooted and its roots interlace those of the augmented Chow polynomial. The proof rewrites the flag h-vector via identity (1.3), expresses the γ-polynomials of Chow polynomials as nonnegative combinations of a family of polynomials p^{S⊆T}_{n,k}, and establishes an interlacing diagram (Theorem 3.3) by induction with explicit base cases. The main theorem implies the FMV24 conjecture for Cohen–Macaulay simplicial posets and recovers previously known cases for uniform matroids.

Significance. The result is significant: it proves a conjecture for a natural class of posets and introduces an interlacing machinery that also gives a new proof of real-rootedness of Eulerian and binomial Eulerian polynomials. The argument is largely self-contained, does not depend on the conjectures under discussion, and the finite base cases are explicit. The positive-h-vector assumption is clearly stated and used exactly where needed, so the scope and limitations of the method are transparent. The decomposition of Chow polynomials into interlacing palindromic components is elegant and likely to be useful beyond this paper.

major comments (4)
  1. [Lemma 3.1] The second display of Lemma 3.1 reads γ(H^{aug}_{\hat P^*}; x) = ∑_{k=0}^n h_k p^{[2,n]}_{n,k}(x), but the third display asserts γ(H^{aug}_{\hat P}; x) = γ(H^{aug}_{\hat P^*}; x) = ∑_{k=0}^n h_k p^{[1,n]}_{n,k}(x). These cannot both be correct. The intended statement, used in the proof of Theorems 1.1/1.2, is γ(H_{\hat P^*}; x) = ∑_{k=0}^n h_k p^{[2,n]}_{n,k}(x). As printed, the proof of Theorem 1.2 does not follow from the stated lemma.
  2. [Proof of Theorems 1.1/1.2] The displayed sums in this proof start at k=1, reading ∑_{k=1}^n h_k p^T_{n,k}, and are then equated with γ-polynomials that Lemma 3.1 expresses as sums from k=0. The omitted h_0 p^T_{n,0} term is generally nonzero; Example 3.2 gives γ(H_{\hat P}; x)=1+5x while ∑_{k=1}^2 h_k p^{{1}}_{2,k}=5x. The index k=1 should be k=0 throughout this passage. As printed, the main theorem is not established by the displayed equalities.
  3. [Lemma 3.8, Eq. (3.7)] Condition (3.7) is stated as p^{T\{1}}_{n,n-1} ⪯ p^{{1}⊆T}_{n,0}, but the same lemma says p^{{1}⊆T}_{n,0} ≡ 0, so the condition is vacuous. The zero-omitted interlacing diagram requires the edge p^{T\{1}}_{n,n-1} ⪯ p^{{1}⊆T}_{n,1}, which is exactly what Lemma 3.13 proves. The subscript n,0 should be n,1 in (3.7), and the proof of Lemma 3.8 should refer to the nonzero bottom-left entry of the zero-omitted diagram.
  4. [Lemmas 3.9–3.11] The index ranges in these induction lemmas do not match the cases needed for Theorem 3.3. For D_n([1,n]) the top, middle, and bottom rows involve T = [2,n], [1,n], and {1}⊆[1,n], respectively; the lemmas state ranges such as T = [2,n−1] or [2,n−2] in Lemma 3.9 and T = [1,n−2] or [1,n−1] in Lemma 3.10, and Lemma 3.11 states p^T_{n,k} instead of p^{{1}⊆T}_{n,k}. These are evidently index slips, but as printed the induction step for D_n([1,n]) is not literally covered. The statements and proofs should be adjusted to the correct ranges and symbols.
minor comments (5)
  1. [Section 3, recursion after (3.1)] The definition of S−1 and T−1 is easy to misread: writing S−1 = {i−1 | i∈S}\{1} seems to remove the shifted element 1, whereas the intended meaning, used in the examples, is to remove 1 from S before shifting. Please clarify, e.g. define S−1 = {i−1 | i∈S, i>1}.
  2. [Proof of Theorem 3.3] The proof says the two base cases for n=1 are given in Lemmas 3.6 and 3.7, but those lemmas treat D_2({1}) and D_2({1,2}), i.e. n=2. The wording should be adjusted.
  3. [Lemma 3.11] The statement of this lemma repeats the notation of Lemma 3.10. Given its title and proof, it should assert interlacing for the bottom row p^{{1}⊆T}_{n,k}, not for p^T_{n,k}.
  4. [Remark 3.4] The remark asserts a nontrivial generalization of Theorem 3.3 with the proof omitted because it is not needed. Since the remark is not used, either label it as a conjecture/planned result or include the proof, otherwise the statement is unverifiable.
  5. [Proof of Theorems 1.1/1.2] The proof refers to a 'pink diagonal arrow' in Theorem 3.3. Color-dependent references are not robust in print or grayscale; describe the arrow by its endpoints.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the interlacing diagram is proven independently and the h-vector enters only as an assumed positive weight vector.

full rationale

The paper's derivation chain is self-contained. It rewrites the flag h-vector of a simplicial poset in terms of its ordinary h-vector via identity (1.3), then expresses the γ-polynomials of the Chow and augmented Chow polynomials as nonnegative linear combinations of permutation-statistic polynomials p^{S⊆T}_{n,k} (Lemma 3.1). The crucial interlacing diagram (Theorem 3.3) is then proved directly by induction in Section 3.1, using only elementary interlacing facts (Lemmas 2.1–2.3) and the recursive definition of the p-polynomials. The h-vector appears only as the assumed coefficient vector; positivity is the theorem's hypothesis, not a fitted or predicted quantity. No parameter is fitted to data, no conjecture is used as input, and no load-bearing step reduces to a self-citation. Citations to prior work are contextual or for known external results (e.g., [ADKE24] for a chain-polynomial result, [FMV24] for definitions/conjectures), not for the interlacing theorem itself. Some local textual issues exist—Lemma 3.8's condition (3.7) writes p^{{1}⊆T}_{n,0}, a zero polynomial, while Lemma 3.13 proves the needed edge with p^{{1}⊆T}_{n,1}; Lemma 3.1's second display is labeled as an augmented polynomial although the later proof uses it for γ(H_{P-hat*}); and Theorem 3.3 as stated covers only T=[1,n] and [1,n−1] while the proof of Theorems 1.1–1.2 also invokes T=[2,n]. These are correctness/typographical risks, not circularity: they do not make any conclusion equivalent to an input by construction. Overall, the central claim has independent mathematical content and is not circular.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The paper introduces no free parameters and no new entities. It relies on standard facts about interlacing, the flag h-vector identity (1.3) for simplicial posets, and the known h-positivity of Cohen-Macaulay posets. The proof is self-contained apart from these standard ingredients.

assumptions (4)
  • standard math Standard facts about real-rooted and interlacing polynomials (Lemma 2.1-2.4, Proposition 2.5), including [Fis08, Bra15, Wag92, Pet15].
    These are cited as known results and are used throughout Section 3 and the induction proofs.
  • domain assumption Equation (1.3): relation between the flag h-vector of P-hat and the h-vector of P, holding for simplicial posets.
    This identity is stated without proof and is the bridge between h-vector positivity and flag data. It is a known result for simplicial posets, but it is not proven in this paper.
  • domain assumption The definition of simplicial poset: all maximal intervals are boolean of the same rank.
    This is the class of posets under study and is used to ensure the flag data behaves like a simplicial complex.
  • domain assumption Known result: Cohen-Macaulay simplicial posets are h-positive [Sta96, Theorem 6.4].
    This is used to claim that the main theorem applies to Cohen-Macaulay simplicial posets.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Chow polynomials of simplicial posets with positive $h$-vector are real-rooted." pith.science (2026). https://pith.science/paper/IXTTVQAI

@misc{pith2026250815538,
  author       = {Pith},
  title        = {Pith review of: Chow polynomials of simplicial posets with positive $h$-vector are real-rooted},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IXTTVQAI}},
  note         = {Machine review of arXiv:2508.15538}
}
abstract

We prove that a finite graded simplicial poset with a top element added has real-rooted Chow and augmented Chow polynomials whenever it has a positive $h$-vector. This class of posets include Cohen-Macaulay simplicial posets and in particular lattices of flats of uniform matroids.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages

  1. [1]

    Athanasiadis, Theo Douvropoulos, and Katerina Kalampogia-Evangelinou, Two classes of posets with real-rooted chain polynomials, Electron

    Christos A. Athanasiadis, Theo Douvropoulos, and Katerina Kalampogia-Evangelinou, Two classes of posets with real-rooted chain polynomials, Electron. J. Combin. 31 (2024), no. 4, Paper No. 4.16, 22. 4816497

    work page 2024

  2. [2]

    Athanasiadis and Katerina Kalampogia-Evangelinou, Chain enumeration, partition lattices and polynomials with only real roots, Comb

    Christos A. Athanasiadis and Katerina Kalampogia-Evangelinou, Chain enumeration, partition lattices and polynomials with only real roots, Comb. Theory 3 (2023), no. 1, Paper No. 12, 21. 4565299

    work page 2023

  3. [3]

    Athanasiadis, Gamma-positivity in combinatorics and geometry, S\'em

    Christos A. Athanasiadis, Gamma-positivity in combinatorics and geometry, S\'em. Lothar. Combin. 77 ([2016--2018]), Art. B77i, 64. 3878174

    work page 2016

  4. [4]

    437--483

    Petter Br \"a nd \'e n, Unimodality, log-concavity, real-rootedness and beyond, 2015, pp. 437--483. 3409348

    work page 2015

  5. [5]

    Petter Br \"a nd \'e n and Lorenzo Vecchi, Chow polynomials of uniform matroids are real-rooted, 2025

    work page 2025

  6. [6]

    Pi 11 (2023), Paper No

    Christopher Eur, June Huh, and Matt Larson, Stellahedral geometry of matroids, Forum Math. Pi 11 (2023), Paper No. e24, 48. 4653766

    work page 2023

  7. [7]

    Steve Fisk, Polynomials, roots, and interlacing, 2008

    work page 2008

  8. [8]

    Matherne, Matthew Stevens, and Lorenzo Vecchi, Hilbert- P oincar\'e series of matroid C how rings and intersection cohomology , Adv

    Luis Ferroni, Jacob P. Matherne, Matthew Stevens, and Lorenzo Vecchi, Hilbert- P oincar\'e series of matroid C how rings and intersection cohomology , Adv. Math. 449 (2024), Paper No. 109733, 55. 4749982

    work page 2024

Show all 17 references
  1. [9]

    Matherne, and Lorenzo Vecchi, Chow functions for partially ordered sets, 2024

    Luis Ferroni, Jacob P. Matherne, and Lorenzo Vecchi, Chow functions for partially ordered sets, 2024

    2024

  2. [10]

    Sch\"utzenberger, Th\'eorie g\'eom\'etrique des polyn\^omes eul\'eriens, Lecture Notes in Mathematics, vol

    Dominique Foata and Marcel-P. Sch\"utzenberger, Th\'eorie g\'eom\'etrique des polyn\^omes eul\'eriens, Lecture Notes in Mathematics, vol. Vol. 138, Springer-Verlag, Berlin-New York, 1970. 272642

    1970

  3. [11]

    Luis Ferroni and Benjamin Schr\"oter, Valuative invariants for large classes of matroids, J. Lond. Math. Soc. (2) 110 (2024), no. 3, Paper No. e12984, 86. 4795885

    2024

  4. [12]

    Simon Hampe, The intersection ring of matroids, J. Combin. Theory Ser. B 122 (2017), 578--614. 3575220

    2017

  5. [13]

    Zhang, Real-rootedness of variations of E ulerian polynomials , Adv

    James Haglund and Philip B. Zhang, Real-rootedness of variations of E ulerian polynomials , Adv. in Appl. Math. 109 (2019), 38--54. 3954084

    2019

  6. [14]

    auser Advanced Texts: Basler Lehrb\

    T. Kyle Petersen, Eulerian numbers, Birkh\"auser Advanced Texts: Basler Lehrb\"ucher. [Birkh\"auser Advanced Texts: Basel Textbooks], Birkh\"auser/Springer, New York, 2015, With a foreword by Richard Stanley. 3408615

    2015

  7. [15]

    Stanley, Combinatorics and commutative algebra, second ed., Progress in Mathematics, vol

    Richard P. Stanley, Combinatorics and commutative algebra, second ed., Progress in Mathematics, vol. 41, Birkh\"auser Boston, Inc., Boston, MA, 1996. 1453579

    1996

  8. [16]

    Wachs, Gamma-positivity of variations of E ulerian polynomials , J

    John Shareshian and Michelle L. Wachs, Gamma-positivity of variations of E ulerian polynomials , J. Comb. 11 (2020), no. 1, 1--33. 4015851

    2020

  9. [17]

    Wagner, Total positivity of H adamard products , J

    David G. Wagner, Total positivity of H adamard products , J. Math. Anal. Appl. 163 (1992), no. 2, 459--483. 1145841

    1992

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.