Real-rootedness of Kazhdan--Lusztig and $Z$-polynomials of thagomizer matroids and graphic matroids of $K_{2,n}$

Philip B. Zhang

REVIEW 1 major objections 3 minor 13 references

Real-rootedness of Kazhdan--Lusztig and $Z$-polynomials of thagomizer matroids and graphic matroids of $K_{2,n}$

T0 review · 1 major / 3 minor · reviewed 2026-08-04 · deepseek-v4-flash

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

Pith's one-line read A one-parameter polynomial family containing the Kazhdan–Lusztig polynomials of thagomizer and K_{2,n} matroids is shown to have only negative, simple real zeros.

desk verdict Real-rootedness for two infinite matroid families, proven by a clean Chebyshev/self-inversive argument; the only soft spot is a dependency on two published transfer identities for K_{2,n}. read the letter →

arxiv 2608.02303 v1 pith:FOLU3SP2 submitted 2026-08-03 math.CO

Philip B. Zhang This is my paper · ORCID

classification math.CO MSC 05B3505A1505A2026C1030C15

keywords Kazhdan–LusztigpolynomialZ-polynomialreal-rootednessthagomizermatroidgraphicChebyshevself-inversiveCatalannumbers

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

For each n≥2, the paper studies the pencil P_n(x)+λx, where P_n is the Kazhdan–Lusztig polynomial of the thagomizer matroid T_n. It proves that for every λ in the interval [0, n/2], this polynomial has exactly ⌊n/2⌋ zeros, all negative and simple. Since the Kazhdan–Lusztig polynomial of the graphic matroid of K_{2,n} equals P_n(x)+x, the theorem immediately makes both matroid families real-rooted. The same rational substitution also shows the common Z-polynomial Z_{T_n}=Z_{K_{2,n}} has n+1 distinct negative zeros. A sympathetic reader would care because real-rootedness is a much stronger property than the known nonnegativity and log-concavity results, and it settles the question for these two graphic families.

What carries the argument

The argument rests on a rational change of variables w=((q−1)/(q+1))^2, which converts each polynomial in the pencil into a palindromic polynomial. For the Kazhdan–Lusztig case, the transformed polynomial is evaluated at roots of unity; a mixed-coefficient estimate for the Catalan generating function yields alternating signs at Chebyshev nodes, giving strict interlacing with the Chebyshev polynomial U_{n−1} and hence the exact zero count. For the Z-polynomial, the same transformation produces a self-inversive polynomial whose coefficients satisfy the Lakatos–Losonczi unit-circle criterion, forcing all zeros onto the unit circle and then, after pulling back, onto the negative real axis.

What would settle it

Compute P_n(x) explicitly from the closed formula (12) for a small even n, say n=6, form P_6(x)+3x, and locate its zeros numerically. The theorem predicts exactly three negative simple zeros. If any zero is complex, repeated, or nonnegative, the central claim fails.

Watch

Extended reading notes

Core claim

The central claim is that for every integer n≥2 and every real λ with 0≤λ≤n/2, the pencil P_n(x)+λx has exactly ⌊n/2⌋ zeros, all negative and simple. Here P_n is the Kazhdan–Lusztig polynomial of the thagomizer matroid T_n=K_{1,1,n}, given explicitly by the Catalan generating function. Setting λ=0 gives real-rootedness of P_n itself; setting λ=1, together with the identity P_{K_{2,n}}(x)=P_n(x)+x, gives real-rootedness for the graphic matroid of K_{2,n}. The paper also proves that the Z-polynomial Z_{T_n}=Z_{K_{2,n}} has n+1 distinct negative zeros for n≥2. All zeros are shown to be not merely real but strictly negative and simple.

Load-bearing premise

The conclusions about K_{2,n} rest on two identities imported from earlier papers — P_{K_{2,n}}(x)=P_n(x)+x and Z_{T_n}(x)=Z_{K_{2,n}}(x) — which the paper does not re-derive; if either were false, the K_{2,n} theorems would be unsupported, though the thagomizer results would stand.

Editorial extensions

If this is right

The Kazhdan–Lusztig polynomials of the thagomizer matroids T_n and of the graphic matroids K_{2,n} are real-rooted for all n≥2, hence their coefficients are log-concave by Newton's inequalities.
The descent polynomial of 321-avoiding permutations, which equals P_n(x), is real-rooted.
The Z-polynomials Z_{T_n}(x)=Z_{K_{2,n}}(x) have n+1 distinct negative zeros for every n≥2, so their γ-polynomials have only simple negative zeros.
The whole pencil P_n(x)+λx is real-rooted throughout the interval 0≤λ≤n/2, not just at the two endpoints that correspond to the matroid families.
All zeros of these polynomials are simple, which rules out repeated-root behavior and makes associated interlacing properties particularly clean.

Reading between the lines

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

The interval 0≤λ≤n/2 may well be maximal; one could test whether λ slightly above n/2 causes a pair of conjugate complex roots to form, which would pinpoint the boundary of real-rootedness in this pencil.
The Chebyshev interlacing technique, combined with the Catalan generating function, might extend to other matroid families whose Kazhdan–Lusztig polynomials satisfy similar algebraic generating functions, such as certain uniform or lattice-path matroids.
The semicircle-moment representation (21) suggests a probabilistic reading of the zeros as supporting measures, which could lead to alternative moment-sequence proofs or to generalizations where the weight Cn−m is replaced by other moment sequences.

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.

Desk Editor's Note

read the letter

Here's my take. This paper proves the Kazhdan–Lusztig polynomials of thagomizer matroids T_n (and the graphic matroid of K_{2,n}) are real-rooted, and with them the full pencil P_n(x)+λx for 0≤λ≤n/2. It also proves the shared Z-polynomial has n+1 distinct negative zeros. That is a real strengthening of the Wu–Zhang log-concavity result; I don't see these statements in the earlier literature.

The technical core is sound. The rational substitution w=((q-1)/(q+1))^2 converts the generating function into a palindromic form. For the KL pencil, the coefficient estimates reduce to one mixed-coefficient lemma for the Catalan series, proved by Lagrange inversion and the von Szily identity; I checked the telescoping and it works. The step from alternating signs at Chebyshev nodes to exact zero counting is legitimate, and the transfer back to the negative real axis preserves simplicity. The Z-polynomial side applies Lakatos–Losonczi correctly: D_n is self-inversive, the strict inequality follows from evaluating at q=1, and the simplicity on the unit circle transfers to the γ-polynomial and then to the Z-polynomial. The degree computation for Γ_n is careful.

The only genuine soft spot is that the K_{2,n} half leans on two imported identities: P_{K_{2,n}}=P_n+x from Gedeon–Proudfoot–Young and Z_{K_{2,n}}=Z_{T_n} from Ferroni–Nasr–Vecchi. The paper does not re-derive them. They are standard and published, but they are load-bearing for Theorems 1.2 and 1.3 as stated for K_{2,n}. If either had a hidden error, that half would collapse; the thagomizer results would survive. I'd want a referee to spot-check those references, but I see no sign of trouble.

This is not a paper that redefines the area, but it settles a natural question for two families and gives a reusable technique for this kind of real-rootedness problem. The writing is clear, the proofs are self-contained except for the cited transfers, and the computations are explicit.

Who should read it: anyone working on real-rootedness of matroid KL polynomials, and people who use Chebyshev interlacing or self-inversive criteria in enumerative combinatorics. I'd send it to a serious referee; it deserves a careful read, and my own verdict is accept.

Referee Report

1 major / 3 minor

Summary. The paper studies real-rootedness of Kazhdan–Lusztig polynomials and Z-polynomials of thagomizer matroids T_n=K_{1,1,n} and of the graphic matroids of K_{2,n}. The main result (Theorem 1.1) states that for every n≥2 and 0≤λ≤n/2, the pencil P_n(x)+λx has exactly ⌊n/2⌋ zeros, all negative and simple. This yields Theorem 1.2: P_n and P_{K_{2,n}}=P_n+x are real-rooted. Theorem 1.3 states that Z_{T_n}=Z_{K_{2,n}} has n+1 distinct negative zeros. The proofs introduce a rational substitution w=((q-1)/(q+1))^2, derive a mixed-coefficient estimate for the Catalan generating function (Lemma 2.2), use alternating signs at Chebyshev nodes, and apply the Lakatos–Losonczi criterion to a self-inversive transformation of the γ-polynomial.

Significance. The paper gives a clean, explicit proof of real-rootedness—a stronger property than the previously known log-concavity—for two natural families of matroids. The one-parameter pencil formulation is elegant, and the methods (Catalan coefficient estimates, Chebyshev interlacing, and self-inversive polynomial criteria) are elementary and potentially applicable to other families. The results are non-obvious and constitute a solid advance. In my assessment the main theorems are correct, but the written proof of Lemma 3.3 contains an algebraic error in its base case, and Remark 2.3 contains a false integral formula; both are local and fixable.

major comments (1)

[Section 3.2, proof of Lemma 3.3, base case r=1] The displayed derivation of D_1(z) is incorrect. From (27) with r=1 and D_0(z)=C(z)/(1-z), the correct expression is D_1(z)=(zC(z)+√(1-4z))/(1-z)=(1-zC(z))/(1-z). The text instead writes D_1(z)=zC(z)+(1-z)√(1-4z)/(1-z)^2, which equals zC(z)+√(1-4z)/(1-z), not the correct value. Consequently the stated E_1(z)=z^3C(z)^4/(1-z)^2 is false; the correct E_1(z) is zC(z)^2/(1-z). Since this is the base case for the induction proving (28), and (28) underlies the coefficient sign pattern in (26) and hence the strict Lakatos–Losonczi inequality in Theorem 3.5, the proof must be corrected. The correction is straightforward and the lemma's conclusion remains true.

minor comments (3)

[Remark 2.3, Eq. (21)] The semicircle-moment representation is false as stated. For n=2, (21) gives \tilde P_2(y)=y^2/2-1, whereas (19) gives 2y^2-1. The integration in (21) yields coefficients C_{n-m}/2^{n-2m} rather than C_{n-m}. Since this remark is not used in the main theorems, either correct the formula or remove or rephrase the remark.
[Introduction / Theorem 1.2] The K_{2,n} assertions are not re-derived in this paper: Theorem 1.2 for K_{2,n} relies on [8, Thm 5.8] and Theorem 1.3 relies on [5, Prop 5.20]. These are published identities, but the paper should explicitly flag them as imported in Section 1 so the reader is aware of the dependency.
[Abstract and Section 2.3] The phrase 'alternating sign evaluations at the zeros of a Chebyshev polynomial' is slightly imprecise: the evaluations are at the nodes c_j=cos(jπ/n), 0≤j≤n, which include the endpoints ±1 in addition to the zeros of U_{n-1}. Consider rephrasing to 'Chebyshev nodes' for accuracy.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: proofs derive real-rootedness from independent generating functions and standard theorems; self-citations are contextual only.

full rationale

The derivation chain starts from Gedeon's generating function (1) and the Ferroni–Nasr–Vecchi identities (22)/(24), all external. Theorem 1.1 is proven by transforming P_n into palindromic B_n, proving mixed-coefficient nonpositivity via Lagrange inversion and the von Szily identity, obtaining alternating signs at Chebyshev nodes, then interlacing with U_{n-1}; none of these steps invokes the theorem being proven. Theorem 1.2 is literally the λ=0 and λ=1 specialization plus the independent identity P_{K_{2,n}}=P_n+x [8, Thm 5.8]. Theorem 1.3 derives the γ-generating function from (22) and (1), applies Lakatos–Losonczi to D_n using the strict inequality ρ_n > (1/2)Σδ_{n,r} obtained from D_n(1)=2^{n+1}, and transfers unit-circle zeros through φ(q) back to negative real zeros; the result is not used in any coefficient estimate. The author's own prior papers [13] and [6] are cited only as background on log-concavity and uniform matroids and play no role in the proofs. The only external dependencies are published identities for K_{2,n}; if those were wrong the K_{2,n} half would be unsupported, but that is a dependency risk, not circularity. No equation is fitted to the quantity being predicted.

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

The paper introduces no new entities and no fitted parameters. It relies on published theorems for the underlying matroid KL/Z polynomials and standard analytic tools. The core new content is the pencil analysis, the mixed-coefficient estimate, and the transfer of zeros through the rational substitution.

assumptions (7)

domain assumption Gedeon's generating function identity (1): ∑_{n≥0} P_n(x) z^n = C(z − (1−x)z^2).
Used throughout §2 to derive (5), (12), and all coefficient-sign facts for the KL pencil; the whole KL argument rests on it.
domain assumption Formula (22): Z_{T_n}(x) = x(1+x)^n + ∑_{r=0}^n binom(n,r)(2x)^{n−r}P_r(x), and equality Z_{T_n}=Z_{K_{2,n}} for n≥2 (Ferroni–Nasr–Vecchi, Prop 5.18/5.20).
Starting point of §3; if false, Theorem 1.3 would not apply to K_{2,n}.
domain assumption Nonnegativity of coefficients of matroid Kazhdan–Lusztig polynomials (singular Hodge theory, Braden–Huh–Matherne–Proudfoot–Wang).
Used in §3 to conclude Z_{T_n} has strictly positive coefficients, enabling the γ-polynomial criterion.
standard math Lakatos–Losonczi unit-circle theorem for self-inversive polynomials.
The key criterion in Theorem 3.5; applied with strict inequality.
standard math von Szily identity for super-Catalan numbers, as recorded by Gessel [9, Section 6].
Used in Lemma 2.2 to evaluate the telescoping sum that proves the mixed-coefficient estimate.
domain assumption Criterion that a palindromic polynomial with positive coefficients is real-rooted iff its γ-polynomial has only negative real zeros (Ferroni–Nasr–Vecchi, Prop 5.3).
Converts real-rootedness of the Z-polynomial into negation of zeros of Γ_n.
domain assumption Proudfoot–Xu–Young palindromicity of Z-polynomials (Z_Tn(x) = x^{n+1} Z_Tn(x^{-1})).
Guarantees existence of the γ-expansion (23) used in Theorem 1.3.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Real-rootedness of Kazhdan--Lusztig and $Z$-polynomials of thagomizer matroids and graphic matroids of $K_{2,n}$." pith.science (2026). https://pith.science/paper/FOLU3SP2

@misc{pith2026260802303,
  author       = {Pith},
  title        = {Pith review of: Real-rootedness of Kazhdan--Lusztig and $Z$-polynomials of thagomizer matroids and graphic matroids of $K_2,n$},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FOLU3SP2}},
  note         = {Machine review of arXiv:2608.02303}
}

abstract

Let $T_n=K_{1,1,n}$, and let $P_n(x)$ denote the Kazhdan--Lusztig polynomial of its graphic matroid. We prove that, whenever $n\ge2$ and $0\le\lambda\le n/2$, the polynomial $P_n(x)+\lambda x$ has exactly $\lfloor n/2\rfloor$ zeros, all of which are negative and simple. In particular, the Kazhdan--Lusztig polynomials of the graphic matroids of $T_n$ and $K_{2,n}$ are real-rooted. We also prove that, for $n\ge2$, the common polynomial $Z_{T_n}(x)=Z_{K_{2,n}}(x)$ has $n+1$ distinct negative zeros. The proofs use a common rational transformation, reducing the Kazhdan--Lusztig case to alternating sign evaluations at the zeros of a Chebyshev polynomial and the $Z$-polynomial case to a unit-circle criterion for self-inversive polynomials.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

13 extracted references · 1 linked inside Pith

[1]

Braden, J

T. Braden, J. Huh, J. P. Matherne, N. Proudfoot, and B. Wang, Singular Hodge theory for combinatorial geometries,J. Amer. Math. Soc., to appear
[2]

Braden and N

T. Braden and N. Proudfoot, Intersection cohomology without spaces, to appear in the Proceedings of the International Congress of Mathematicians 2026

2026
[3]

Cheng and S

R. Cheng and S. Liu, Kazhdan–Lusztig polynomials of matroids need not be unimodal, arXiv:2607.24186v2, 2026

arXiv 2026
[4]

Elias, N

B. Elias, N. Proudfoot, and M. Wakefield, The Kazhdan–Lusztig polynomial of a matroid,Adv. Math.299(2016), 36–70

2016
[5]

Ferroni, G

L. Ferroni, G. D. Nasr, and L. Vecchi, Stressed hyperplanes and Kazhdan–Lusztig γ-positivity for matroids,Int. Math. Res. Not. IMRN(2023), no. 24, 20883–20942

2023
[6]

A. L. L. Gao, L. Lu, M. H. Y. Xie, A. L. B. Yang, and P. B. Zhang, The Kazhdan–Lusztig polynomials of uniform matroids,Adv. in Appl. Math.122(2021), Paper No. 102117

2021
[7]

K. R. Gedeon, Kazhdan–Lusztig polynomials of thagomizer matroids,Electron. J. Combin.24 (2017), no. 3, Paper No. P3.12

2017
[8]

Gedeon, N

K. Gedeon, N. Proudfoot, and B. Young, Kazhdan–Lusztig polynomials of matroids: a survey of results and conjectures,S´ em. Lothar. Combin.78B(2017), Art. 80. 13

2017

Show all 13 references

[9]

I. M. Gessel, Super ballot numbers,J. Symbolic Comput.14(1992), no. 2–3, 179–194

1992
[10]

Lakatos and L

P. Lakatos and L. Losonczi, Self-inversive polynomials whose zeros are on the unit circle,Publ. Math. Debrecen65(2004), no. 3–4, 409–420

2004
[11]

Proudfoot, Y

N. Proudfoot, Y. Xu, and B. Young, The Z-polynomial of a matroid,Electron. J. Combin.25 (2018), no. 1, Paper No. P1.26

2018
[12]

Vella, Pattern avoidance in permutations: linear and cyclic orders,Electron

A. Vella, Pattern avoidance in permutations: linear and cyclic orders,Electron. J. Combin.9 (2002/03), no. 2, Research Paper R18

2002
[13]

Wu and P

S. Wu and P. B. Zhang, The log-concavity of Kazhdan–Lusztig polynomials of thagomizer matroids,Discrete Math.346(2023), no. 7, Paper No. 113381. 14

2023

Pith tools

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

[1] [1]

Braden, J

T. Braden, J. Huh, J. P. Matherne, N. Proudfoot, and B. Wang, Singular Hodge theory for combinatorial geometries,J. Amer. Math. Soc., to appear

[2] [2]

Braden and N

T. Braden and N. Proudfoot, Intersection cohomology without spaces, to appear in the Proceedings of the International Congress of Mathematicians 2026

2026

[3] [3]

Cheng and S

R. Cheng and S. Liu, Kazhdan–Lusztig polynomials of matroids need not be unimodal, arXiv:2607.24186v2, 2026

arXiv 2026

[4] [4]

Elias, N

B. Elias, N. Proudfoot, and M. Wakefield, The Kazhdan–Lusztig polynomial of a matroid,Adv. Math.299(2016), 36–70

2016

[5] [5]

Ferroni, G

L. Ferroni, G. D. Nasr, and L. Vecchi, Stressed hyperplanes and Kazhdan–Lusztig γ-positivity for matroids,Int. Math. Res. Not. IMRN(2023), no. 24, 20883–20942

2023

[6] [6]

A. L. L. Gao, L. Lu, M. H. Y. Xie, A. L. B. Yang, and P. B. Zhang, The Kazhdan–Lusztig polynomials of uniform matroids,Adv. in Appl. Math.122(2021), Paper No. 102117

2021

[7] [7]

K. R. Gedeon, Kazhdan–Lusztig polynomials of thagomizer matroids,Electron. J. Combin.24 (2017), no. 3, Paper No. P3.12

2017

[8] [8]

Gedeon, N

K. Gedeon, N. Proudfoot, and B. Young, Kazhdan–Lusztig polynomials of matroids: a survey of results and conjectures,S´ em. Lothar. Combin.78B(2017), Art. 80. 13

2017