Pith. sign in

REVIEW 2 major objections 5 minor 21 references

Log-concavity of inverse Kazhdan-Lusztig polynomials of paving matroids

T0 review · 2 major / 5 minor · reviewed 2026-08-16 · deepseek-v4-flash

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

Pith's one-line read For any paving matroid, the inverse Kazhdan-Lusztig polynomial is log-concave with no internal zeros.

desk verdict Strong result for paving matroids, but the proof hinges on unverified Mathematica discriminants and misses small-rank cases in two lemmas. read the letter →

arxiv 2504.17567 v1 pith:3L43GK5N submitted 2025-04-24 math.CO

Matthew H.Y. Xie , Philip B. Zhang This is my paper · ORCID
classification math.CO MSC 05A2005B3533F1026C10
keywords log-concavityinverseKazhdan-Lusztigpolynomialpavingmatroidreal-rootedpolynomialsinterlacingmultipliersequenceHadamardproductNewton'sinequalities
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

This paper proves a real-rootedness theorem that yields log-concavity: for every paving matroid, the Hadamard product of its inverse Kazhdan-Lusztig polynomial with $(1+t)^n$ has only real roots. Newton's inequalities then force the coefficients to form a log-concave sequence with no internal zeros, resolving a 2021 conjecture for the paving family. The proof reduces the problem to three explicit interlacing relations among uniform-matroid polynomials, with the needed sign of the Wronskian checked at $t=0$ and three cubic discriminants verified by computer algebra. The result also implies higher-order Turán inequalities for these coefficients.

What carries the argument

The gearing is the Hadamard operator $B$: $B(\sum a_i t^i)=\sum \binom{n}{i} a_i t^i$, which turns coefficient inequalities into root-location statements. Interlacing of real-rooted polynomials (via Hermite-Kakeya-Obreschkoff and Wronskian sign checks) and multiplier sequences or $n$-sequences (Pólya-Schur, Craven-Csordas) carry the proof. The concrete engine is the paving-matroid decomposition $Q_M(t)=Q_{U_{m,d}}(t)-\sum_h \lambda_h (Q_{U_{h,d}}(t)-Q_{U_{h,d-1}}(t))$; interlacing is proved by checking Wronskians at $t=0$ and by computer-assisted positivity of discriminants of three cubic polynomials $p_1,p_3,p_5$.

What would settle it

Run the same three discriminant checks with $n,m,d$ explicitly declared integers (or search the parameter range numerically) and find any triple with a non-positive discriminant; alternatively, compute $B(Q_M(t))$ for a concrete paving matroid and find a non-real root.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.3: for a paving matroid $M$ of rank $d$, the degree-$n$ polynomial $B(Q_M(t))$ obtained by multiplying the coefficient of $t^i$ by $\binom{n}{i}$ has only real roots. Since the coefficients of $Q_M(t)$ are nonnegative and form an $n$-sequence with respect to this operator, the algebraic characterization of $n$-sequences transfers real-rootedness to $B(Q_M(t))$; Newton's inequalities then give Theorem 1.2, the log-concavity of $Q_M(t)$ with no internal zeros. The argument uses the decomposition of $Q_M(t)$ for paving matroids as a nonnegative combination of differences of uniform-matroid inverse Kazhdan-Lusztig polynomials and proves interlacing of the corresponding $B$-transforms.

Load-bearing premise

The load-bearing premise is that the computer algebra output correctly proves strict positivity of the three cubic discriminants for all allowed integers; if that output is faulty or the domains were not specified as integers, the interlacing chain and both theorems fall.

Editorial extensions

If this is right

  • For every paving matroid, the coefficients of $Q_M(t)$ form a log-concave sequence with no internal zeros (Theorem 1.2).
  • The same coefficients satisfy the higher-order Turán inequalities, by Corollary 1.5 and Mařík's theorem.
  • Every coefficient of $Q_M(t)$ below the top degree is positive, with the top coefficient possibly zero (Proposition 4.3).
  • The real-rootedness of $B(Q_M(t))$ supplies a template for the more general conjecture: if $B(Q_M)$ is real-rooted for a matroid, log-concavity follows automatically.

Reading between the lines

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

  • The Hadamard-twist method may extend to non-paving families, since the proof only needs a uniform-type decomposition plus interlacing of $B$-transforms; checking the few small non-paving matroids with known inverse Kazhdan-Lusztig polynomials would be a cheap first test.
  • If the more general conjecture holds, the log-concavity conjecture would follow for all matroids, and the real-rooted operator $B$ would give a route to higher-order Turán inequalities beyond paving.
  • The paper's positivity method, combined with the proposed degree conjecture, suggests that paving matroids could serve as a test bed for strict positivity of Kazhdan-Lusztig polynomial coefficients.
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

2 major / 5 minor

Summary. The paper proves that the inverse Kazhdan-Lusztig polynomial of any paving matroid has log-concave coefficients with no internal zeros (Theorem 1.2). The proof goes through the stronger statement (Theorem 1.3) that the Hadamard product B(Q_M(t)) of Q_M(t) with (1+t)^n, where n is the degree of Q_M, is real-rooted. Using the explicit formula for uniform matroids and the Ferroni--Nasr--Vecchi decomposition of paving matroids into stressed hyperplanes, the authors reduce real-rootedness to interlacing statements for the polynomials B(Q_{U_{m,d}}) and B(Q_{U_{h,d}}-Q_{U_{h,d-1}}). The interlacing is established through Hermite-Kakeya-Obreschkoff and multiplier-sequence arguments, with a final n-sequence transfer that handles the nonlinearity of B on polynomials of different degrees. The central interlacing lemmas depend on three Mathematica Resolve[ForAll] computations asserting positivity of certain discriminants.

Significance. If the computational ingredients are made fully rigorous and reproducible, this is a substantial result: it confirms the Gao--Xie log-concavity conjecture for the broad class of paving matroids and introduces a plausible real-rootedness strengthening (Conjecture 1.4) with a clean proof strategy. The use of n-sequences to handle the degree dependence of the Hadamard operator is elegant, and the explicit Wronskian sign computations in Lemmas 3.3--3.5 are checkable and appear correct. The nonnegativity of coefficients from Braden--Huh--Matherne--Proudfoot--Wang is used correctly, and the proof of Theorem 1.3 is not circular with respect to Conjecture 1.4. The main obstacles are verification gaps in the computational lemmas rather than flaws in the overall architecture.

major comments (2)
  1. [Lemmas 3.3--3.5] The proofs of Lemmas 3.3--3.5 rest entirely on the Mathematica commands In[1] through In[12], whose printed forms are not reproducible. As printed, In[1] contains an expression like "n∑_{i=0}" rather than a valid Sum command, and none of the Resolve[ForAll[...]] calls declares n, m, h, d as integers, even though the factorizations (t+1)^{n-3} and the binomial sums are only meaningful for integer n. No notebook, code file, or independent certificate (e.g., a Sturm sequence or an explicit discriminant factorization) is supplied. Since the positivity of the discriminants of p1, p3, p4, and p5 is the only support for the interlacing conclusions, the proof of Theorem 1.3 is conditional on unverifiable computation. The authors should provide executable code with explicit integer domains, or replace each Resolve output by a checkable analytic argument.
  2. [Lemmas 3.4 and 3.5] Both Lemma 3.4 and Lemma 3.5 are stated for all d ≥ 3, but the Resolve commands only cover the range n ≥ 3, which corresponds to d ≥ 7. Lemma 3.3 at least mentions a direct Mathematica verification for d = 3, 4, 5, 6, but Lemmas 3.4 and 3.5 contain no such discussion. Thus the interlacing statements for d ≤ 6 are unproved in the text. Since Lemma 3.2 and hence Theorem 1.3 require the chain f0 ≪ fm and f_{i-1} ≪ f_i for every d ≥ 3, these omitted cases are load-bearing and must be supplied, either by explicit finite checks or by an argument showing they are automatically covered by the same Wronskian sign and real-rootedness of the relevant linear and quadratic polynomials.
minor comments (5)
  1. [Proof of Lemma 3.2] The sentence "It follows from Lemmas 3.2, 3.3, and 3.4" should read "It follows from Lemmas 3.3, 3.4, and 3.5."
  2. [Lemma 3.5] In the display after the formula for B(Q_{U_{m,d}}(t)) + k B(Q_{U_{m,d}}(t) - Q_{U_{m,d-1}}(t)), the symbol p3 should be p5.
  3. [Definition 2.2] The notation "Γ = {γ_i}^n_{k=0}" has mismatched indices; it should be "Γ = {γ_i}_{i=0}^n."
  4. [Theorem 1.3, proof] The step "By Theorem 2.5, we conclude that the coefficients of Q_M(t) form a floor((d-1)/2)-sequence" is very terse. It would help to spell out that the degree-n Hadamard product of Q_M has only real roots, hence the coefficient sequence of Q_M is an n-sequence, and then applying this n-sequence to (1+t)^{deg Q_M} yields the desired B(Q_M(t)).
  5. [Proposition 4.3] The proof's claim that a linear combination af(t)+bg(t) of two degree-n real-rooted polynomials has degree n or n-1 is false; for example, f(t) = (t+1)^2 and g(t) = t^2 + 2t are both real-rooted with nonnegative coefficients, but f - g = 1 has degree 0. The lower bound on deg B(Q_M(t)) is therefore not established by the given argument.

Circularity Check

1 steps flagged · score 2.0 of 10

No substantive circularity; the only literal self-reference is a numbering typo in the proof of Lemma 3.2.

  1. other [Section 3, Proof of Lemma 3.2]
    "It follows from Lemmas 3.2, 3.3, and 3.4 that f0 ≪ fm and fi−1 ≪ fi for all 1 ≤ i ≤ m."

    The proof of Lemma 3.2 cites Lemma 3.2 itself among the lemmas used to prove it. Taken literally, this makes the lemma an input to its own proof, a self-referential circular step. In context, however, the intended citation is almost certainly Lemmas 3.3, 3.4, and 3.5: Lemma 3.5 supplies f0 ≪ f1, Lemma 3.4 supplies fi−1 ≪ fi for i ≥ 2, and Lemma 3.3 supplies f0 ≪ fm. The surrounding inequalities make the intended argument clear, so this is a typographical self-reference rather than a substantive circular dependency.

full rationale

The paper's derivation of Theorem 1.3 for paving matroids is self-contained relative to its cited external inputs. The uniform‐matroid formula (3.1) comes from Gao–Xie [10], a prior peer‐reviewed result; even though one author overlaps with the present paper, it is not derived from the current claim and hence does not constitute load‐bearing circularity. Theorem 3.1 from Ferroni–Nasr–Vecchi [9] is also external. The interlacing lemmas (3.3–3.5) are proved by direct discriminant and Wronskian computations, not by assuming the target theorem. The final transfer from B_n(QM) to B(QM) via the n‐sequence property (Theorem 2.5) is a genuine two‐step argument: first B_n(QM) is shown real‐rooted by the interlacing chain, then the coefficient sequence of QM is certified as an n‐sequence, and only then is B(QM) obtained by applying that n‐sequence to (1+t)^{n'}. This is not a tautology or a renamed fit. Conjecture 1.4 is stated but not used as an assumption. The only literal circular text is the self‐referencing sentence in the proof of Lemma 3.2, which is evidently a numbering typo for Lemmas 3.3, 3.4, and 3.5. Therefore the circularity score is 2, reflecting the minor self‐reference without any substantive circular reduction.

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

The central claim rests on external formulas from [9] and [10], standard interlacing theory, and a Mathematica-assisted discriminant check. No free parameters or invented entities are introduced; the λ_h are matroid data. The computational step is the main fragility.

assumptions (9)
  • domain assumption Explicit formula for Q_{U_{m,d}}(t) (Equation 3.1) from Gao-Xie [10].
    Quoted without proof; the starting point for all uniform matroid computations.
  • domain assumption Theorem 3.1: Q_M(t) = Q_{U_{m,d}}(t) - sum_{h=1}^m λ_h (Q_{U_{h,d}}(t) - Q_{U_{h,d-1}}(t)) for paving matroids M, from Ferroni-Nasr-Vecchi [9].
    Reduces paving matroids to uniform matroids with stressed hyperplane weights λ_h.
  • domain assumption Nonnegativity of coefficients of Q_M(t) for all matroids, from Braden et al. [1, Theorem 1.5].
    Needed to apply the n-sequence characterization and Newton's inequalities.
  • ad hoc to paper The Mathematica Resolve[ForAll] outputs in Lemmas 3.3, 3.4, 3.5 (Out[3], Out[6], Out[9], Out[12]) correctly assert positive discriminants for p1, p3, p5 over the stated parameter ranges.
    Load-bearing computational step; no notebook or certificate is shipped, and the printed input lines are fragmented. If false, the interlacing lemmas fail.
  • ad hoc to paper The direct Mathematica verification for small degrees d=3,4,5,6 in Lemma 3.3 is correct.
    Claimed without showing details; covers low-degree cases not handled by the discriminant argument.
  • standard math The Wronskian sign at t=0 determines the interlacement order: W <= 0 implies f << g.
    Follows from the constant sign of W for interlacing pairs and standard facts about the Wronskian.
  • standard math The algebraic characterization of n-sequences (Theorem 2.5) and the Pólya-Schur theorem (Theorem 2.4) apply to the coefficient sequences used.
    Used to convert real-rootedness of Γ[(1+t)^n] into n-sequence statements and back.
  • standard math Newton's inequalities: a real-rooted polynomial with nonnegative coefficients has log-concave coefficients.
    Bridges Theorem 1.3 to Theorem 1.2.
  • standard math Interlacing lemmas 2.1 and 2.2 are valid.
    Assembles the interlacing chain from Lemmas 3.3 to 3.5 onto the paving matroid decomposition.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Log-concavity of inverse Kazhdan-Lusztig polynomials of paving matroids." pith.science (2026). https://pith.science/paper/3L43GK5N

@misc{pith2026250417567,
  author       = {Pith},
  title        = {Pith review of: Log-concavity of inverse Kazhdan-Lusztig polynomials of paving matroids},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3L43GK5N}},
  note         = {Machine review of arXiv:2504.17567}
}
abstract

Gao and Xie (2021) conjectured that the inverse Kazhdan-Lusztig polynomial of any matroid is log-concave. Although the inverse Kazhdan-Lusztig polynomial may not always have only real roots, we conjecture that the Hadamard product of an inverse Kazhdan-Lusztig polynomial of degree $n$ and $(1+t)^n$ has only real roots. Using interlacing polynomials and multiplier sequences, we confirm this conjecture for paving matroids. This result allows us to confirm the log-concavity conjecture for these matroids by applying Newton's inequalities.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

21 extracted references · 20 canonical work pages

  1. [1]

    Braden, J

    T. Braden, J. Huh, J. P. Matherne, N. Proudfoot, and B. Wan g, Singular Hodge theory for combinatorial geometries, arXiv:2010.06088

    arXiv 2010

  2. [12]

    Mařík, On polynomials with all real zeros, Čas

    J. Mařík, On polynomials with all real zeros, Čas. Pěst. Mat. , 89 (1964), 5–9

    work page 1964

  3. [2]

    Brändén, On linear transformations preserving the Pó lya frequency property, Trans

    P. Brändén, On linear transformations preserving the Pó lya frequency property, Trans. Amer. Math. Soc. , 358 (2006), 3697–3716

    work page 2006

  4. [3]

    Brändén, Unimodality, log-concavity, real-rootedn ess and beyond, in: Handbook of enumerative combinatorics , Discrete Math

    P. Brändén, Unimodality, log-concavity, real-rootedn ess and beyond, in: Handbook of enumerative combinatorics , Discrete Math. Appl., CRC Press, Boca Raton, FL, 2015, 437–483

    work page 2015

  5. [4]

    W. Y. C. Chen, D. X. Q. Jia, and L. X. W. Wang, Higher order Tu rán inequalities for the partition function, Trans. Amer. Math. Soc. , 372 (2019), 2143–2165

    work page 2019

  6. [5]

    Craven and G

    T. Craven and G. Csordas, Location of zeros part I: Real po lynomials and entire functions, Illinois J. Math. , 27 (1983), 244–278

    work page 1983

  7. [6]

    Craven and G

    T. Craven and G. Csordas, Composition theorems, multipl ier sequences and complex zero decreasing sequences, in: Value distribution theory and related topics , vol. 3 of Adv. Complex Anal. Appl. , Kluwer Acad. Publ., Boston, MA, 2004, 131–166

    work page 2004

  8. [7]

    J. P. Dedieu, Obreschkoff’s theorem revisited: what conv ex sets are contained in the set of hyperbolic polynomials?, J. Pure Appl. Algebra , 81 (1992), 269–278

    work page 1992

Show all 21 references
  1. [8]

    Elias, N

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

    2016

  2. [9]

    Ferroni, G

    L. Ferroni, G. D. Nasr, and L. Vecchi, Stressed hyperplan es and kazhdan–lusztig gamma-positivity for matroids, Int. Math. Res. Not. , (2023), 20883–20942

    2023

  3. [10]

    A. L. L. Gao and M. H. Y. Xie, The inverse Kazhdan-Lusztig polynomial of a matroid, J. Combin. Theory Ser. B , 151 (2021), 375–392

    2021

  4. [11]

    Gedeon, N

    K. Gedeon, N. Proudfoot, and B. Young, Kazhdan-Lusztig polynomials of matroids: a survey of results and conjectures, Sém. Lothar. Combin. , 78B (2017), Art. 80, 12

    2017

  5. [13]

    K. Ono, S. Pujahari, and L. Rolen, Turán inequalities fo r the plane partition function, Adv. Math., 409 (2022), 108692

    2022

  6. [14]

    Pólya and J

    G. Pólya and J. Schur, Über zwei arten von Faktorenfolge n in der Theorie der alge- braischen Gleichungen, J. Reine Angew. Math. , 144 (1914), 89–113

    1914

  7. [15]

    E. C. Titchmarsh, The theory of functions , Oxford University Press, 1939. 14

    1939

  8. [16]

    Vecchi, On matroid modularity and the coefficients of t he inverse Kazhdan-Lusztig polynomial of a matroid, arXiv:2103.08580

    L. Vecchi, On matroid modularity and the coefficients of t he inverse Kazhdan-Lusztig polynomial of a matroid, arXiv:2103.08580

    arXiv

  9. [17]

    D. G. Wagner, Total positivity of Hadamard products, J. Math. Anal. Appl. , 163 (1992), 459–483

    1992

  10. [18]

    D. G. Wagner, Multivariate stable polynomials: theory and applications, Bull. Amer. Math. Soc. (N.S.) , 48 (2011), 53–84

    2011

  11. [19]

    Wu and P

    S. Wu and P. B. Zhang, The log-concavity of Kazhdan-Lusz tig polynomials of thagomizer matroids, Discrete Math., 346 (2023), 113381

    2023

  12. [20]

    M. H. Y. Xie and P. B. Zhang, The log-concavity of Kazhdan -Lusztig polynomials of uniform matroids, J. Syst. Sci. Complex. , 36 (2023), 117–128

    2023

  13. [21]

    Zaslavsky, The Möbius function and the characterist ic polynomial, in: Combi- natorial geometries , vol

    T. Zaslavsky, The Möbius function and the characterist ic polynomial, in: Combi- natorial geometries , vol. 29 of Encyclopedia Math. Appl. , Cambridge Univ. Press, Cambridge, 1987, 114–138. 15

    1987

Pith tools

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