arxiv: 2603.21680 · v3 · submitted 2026-03-23 · 🧮 math.CO · math.AG

Recognition: 2 theorem links

· Lean Theorem

Inequalities for Chow Polynomials and Chern Numbers of Matroids

Ronnie Cheng , Wangyang Lin

Authors on Pith no claims yet

Pith reviewed 2026-05-15 00:56 UTC · model grok-4.3

classification 🧮 math.CO math.AG MSC 05B35

keywords matroidChow polynomialChern numbersinequalitiesmoment inequalitiesHirzebruch genusgamma-positivityflags of flats

0 comments

The pith

Normalized Chow coefficients of a matroid form a probability distribution whose central moments imply new inequalities among Chern numbers.

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

The paper interprets the coefficients of the Chow polynomial of a matroid, after normalization, as the probabilities in a discrete distribution. It then derives inequalities satisfied by the central moments of this distribution. These moment inequalities lead to bounds on the number of flags of flats and to restrictions on where the roots of the Chow polynomial can lie. Connecting the same moments to the Hirzebruch chi_y genus produces corresponding inequalities among the Chern numbers of the matroid. The strongest of these is the relation c1 times c sub d minus 1 is at most c sub d, with equality only when d equals 1 or the matroid simplifies to a Boolean matroid.

Core claim

For any matroid of rank d+1 the Chern numbers satisfy c_1 c_{d-1} ≤ c_d, with equality if and only if d=1 or the simplification of the matroid is Boolean. This follows from showing that the normalized Chow coefficients form a probability distribution and then applying moment inequalities that translate directly into the Chern-number relation via the Hirzebruch χ_y-genus.

What carries the argument

The normalized Chow coefficients viewed as a probability distribution, from which central-moment inequalities are derived and then mapped to Chern-number inequalities through the Hirzebruch χ_y-genus.

Load-bearing premise

The normalized Chow coefficients can be treated as a probability distribution whose central moments satisfy the moment inequalities used in the proof.

What would settle it

A single explicit matroid of rank greater than 2 whose simplification is not Boolean and for which c1 c_{d-1} exceeds c_d would disprove the central inequality.

read the original abstract

The Chow polynomial of a matroid is a fundamental invariant whose coefficients exhibit strong positivity properties, including $\gamma$-positivity. We interpret the normalized Chow coefficients as a probability distribution and establish new inequalities for its central moments. As consequences, we obtain bounds on the number of flags of flats and inequalities on the roots of the Chow polynomial. We further relate these moment inequalities to algebraic geometry via the Hirzebruch $\chi_y$-genus. This yields new inequalities for matroidal Chern numbers. In particular, for any matroid of rank $d+1$, we prove that $c_1c_{d-1}\le c_d$, with equality if and only if $d=1$ or the simplification of the matroid is Boolean.

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

The paper proves c1 c_{d-1} ≤ c_d for matroid Chern numbers by turning normalized Chow coefficients into a probability distribution and deriving moment inequalities.

read the letter

The main takeaway is that the authors establish c₁ c_{d-1} ≤ c_d for any matroid of rank d+1, with equality if and only if d=1 or the simplification is Boolean. They do this by normalizing the Chow coefficients to a probability distribution, proving new central-moment inequalities, and mapping the result through the Hirzebruch χ_y-genus to the Chern numbers. They also extract bounds on flag numbers of flats and on the roots of the Chow polynomial as side results. The equality case is stated cleanly and looks usable for spotting Boolean-like behavior. The approach is straightforward once the probability interpretation is in place, and it builds directly on known non-negativity and γ-positivity without obvious circularity. The derivation of the moment inequalities is the genuinely new step, and the genus translation appears direct from the expansion. Soft spots are limited. The central moment bounds need the full write-up to confirm they hold for all matroids without hidden restrictions on simplicity or rank, and one should check whether the Chern-number definitions introduce any normalization subtleties in the genus formula. No post-hoc fitting or invented quantities show up. This paper is for matroid theorists already working on positivity, Chow polynomials, or matroid Chern numbers. A reader who knows the background will get concrete new bounds and a probabilistic route to them. It is not broad enough to interest outsiders, but the claim is specific and checkable. I would send it to peer review. The result is new, the method is honest, and referees can verify the moment steps and test the equality cases on examples.

Referee Report

1 major / 2 minor

Summary. The paper interprets the normalized coefficients of the Chow polynomial of a matroid as a probability distribution, derives new inequalities on its central moments, and obtains consequences for the number of flags of flats and the roots of the Chow polynomial. It then relates these moment inequalities to matroidal Chern numbers through the Hirzebruch χ_y-genus, proving in particular that c_1 c_{d-1} ≤ c_d for any matroid of rank d+1, with equality if and only if d=1 or the simplification of the matroid is Boolean.

Significance. If the central claims hold, the work supplies a probabilistic lens on the γ-positivity of Chow polynomials that yields concrete, new inequalities for Chern numbers. This strengthens the dictionary between combinatorial invariants and algebraic geometry for matroids and provides falsifiable predictions that can be checked on small-rank examples.

major comments (1)

[Section on Hirzebruch genus and Chern numbers] The mapping from central-moment inequalities to the Chern-number relation c_1 c_{d-1} ≤ c_d is asserted via the explicit expansion of the Hirzebruch χ_y-genus; the manuscript should include a self-contained verification of this translation (including the precise normalization constants) in the section that derives the Chern-number inequality.

minor comments (2)

[Introduction and Section 2] Clarify the precise normalization used to turn Chow coefficients into a probability distribution (e.g., whether it is by the total sum or by the leading coefficient) and confirm it is consistent with the γ-positivity statements cited.
[Theorem on Chern-number inequality] The equality case for Boolean matroids should be illustrated with a small explicit example (rank 3 or 4) to make the statement immediately checkable.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for the constructive suggestion to improve the clarity of the Hirzebruch genus argument. We will revise the paper to incorporate the requested self-contained verification.

read point-by-point responses

Referee: [Section on Hirzebruch genus and Chern numbers] The mapping from central-moment inequalities to the Chern-number relation c_1 c_{d-1} ≤ c_d is asserted via the explicit expansion of the Hirzebruch χ_y-genus; the manuscript should include a self-contained verification of this translation (including the precise normalization constants) in the section that derives the Chern-number inequality.

Authors: We agree that a self-contained verification of the translation would enhance readability. In the revised manuscript we will insert an explicit computation deriving the inequality c_1 c_{d-1} ≤ c_d directly from the central-moment inequalities via the Hirzebruch χ_y-genus expansion, with all normalization constants stated explicitly, placed in the section that establishes the Chern-number relation. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The paper normalizes Chow coefficients (via established non-negativity and γ-positivity) into a probability distribution, derives fresh central-moment inequalities on that distribution, and maps them algebraically to the Chern-number inequality c₁c_{d-1} ≤ c_d through the explicit Hirzebruch χ_y-genus expansion. No quoted step reduces by definition to its own output, renames a fitted parameter as a prediction, or relies on a load-bearing self-citation whose content is unverified outside the paper. The positivity inputs are independent of the new moment bounds, and the translation is a direct polynomial identity. The result is therefore not forced by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper relies on the known γ-positivity of Chow polynomials and the definition of the Hirzebruch χ_y-genus; no free parameters or new entities are introduced in the abstract.

axioms (2)

domain assumption Chow coefficients of a matroid are non-negative and sum to a positive integer (normalizable to a probability distribution)
Invoked when the authors interpret normalized coefficients as probabilities
domain assumption The Hirzebruch χ_y-genus relates the Chow polynomial to the Chern numbers of the matroid
Used to translate moment inequalities into Chern-number inequalities

pith-pipeline@v0.9.0 · 5418 in / 1297 out tokens · 24585 ms · 2026-05-15T00:56:55.646121+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/Cost/FunctionalEquation.lean washburn_uniqueness_aczel (J uniqueness) echoes

?

echoes
ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

We interpret the normalized Chow coefficients as a probability distribution and establish new inequalities for its central moments... Theorem A... CMFS... fk(a+b+2) ≥ sum binom(k,i) fi(a) fj(b)
IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

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

c1 cd-1(M) ≤ cd(M) with equality iff d=1 or simplification is Boolean

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.