Papers
Topics
Authors
Recent
Search
2000 character limit reached

Chow Polynomial in Combinatorics

Updated 12 July 2026
  • Chow Polynomial is a palindromic invariant defined on graded posets or matroids as the Hilbert–Poincaré series of their Chow rings, capturing key combinatorial and geometric structures.
  • It exhibits properties like gamma-positivity, unimodality, and often real-rootedness, with explicit recursive and combinatorial formulas underpinning its structure.
  • Applications range from uniform matroids with explicit coefficient formulas to geometric contexts in polyhedral, toric, and flag enumeration theories.

Searching arXiv for papers on Chow polynomials, especially uniform matroids and foundational poset formulations. A Chow polynomial, in the contemporary combinatorics and matroid literature, is a palindromic polynomial attached to a bounded graded poset or to a matroid, most commonly as the Hilbert–Poincaré series of a Chow ring. For a loopless matroid MM, the ordinary Chow polynomial is the Hilbert–Poincaré series of the Chow ring, while the augmented Chow polynomial is the Hilbert–Poincaré series of the augmented Chow ring (Stump, 2024). More generally, recent work defines Chow functions for kernels in incidence algebras of weakly ranked posets and recovers the bounded-poset Chow polynomial as the (0^,1^)(\hat0,\hat1)-entry of that function (Ferroni et al., 2024). The subject now sits at the intersection of matroid Hodge theory, Kazhdan–Lusztig–Stanley theory, flag enumeration, and polyhedral and toric geometry, with explicit formulas, γ\gamma-expansions, real-rootedness theorems, and geometric realizations developed in several directions (Ferroni et al., 2022).

1. Formal definitions

For a finite graded poset PP with unique minimum 0^\hat0 and maximum 1^\hat1, one formulation defines the Chow polynomial by summing reduced characteristic polynomials over chains. If C={C1<<Ck<Ck+1}C=\{C_1<\dots<C_k<C_{k+1}\} is a chain ending at Ck+1=1^C_{k+1}=\hat1, with

χP,C(q)=i=1kχ[Ci,Ci+1](q),\overline{\chi}_{P,C}(q)=\prod_{i=1}^k \overline{\chi}_{[C_i,C_{i+1}]}(q),

then, for rk(P)>0\operatorname{rk}(P)>0,

(0^,1^)(\hat0,\hat1)0

where the sum ranges over chains with (0^,1^)(\hat0,\hat1)1, and

(0^,1^)(\hat0,\hat1)2

where the sum ranges over all chains ending at (0^,1^)(\hat0,\hat1)3. In the matroid case, with (0^,1^)(\hat0,\hat1)4, these recover the Hilbert–Poincaré series of the Chow ring and augmented Chow ring (Stump, 2024).

A more general framework starts from a weakly ranked poset (0^,1^)(\hat0,\hat1)5 and a kernel (0^,1^)(\hat0,\hat1)6 in the incidence algebra. Writing the reduced kernel as

(0^,1^)(\hat0,\hat1)7

the Chow function is

(0^,1^)(\hat0,\hat1)8

If (0^,1^)(\hat0,\hat1)9 is bounded, the γ\gamma0-entry γ\gamma1 is the γ\gamma2-Chow polynomial (Ferroni et al., 2024). This formalism subsumes the characteristic-kernel case and supports ordinary, augmented, and later dual variants.

In matroid notation, several symbol conventions coexist. The literature cited here includes γ\gamma3, γ\gamma4, and γ\gamma5 for the ordinary Chow polynomial, and γ\gamma6, γ\gamma7, or γ\gamma8 for augmented variants (Ferroni et al., 2022).

2. Structural descriptions and γ\gamma9-expansions

A central structural result identifies Chow and augmented Chow polynomials as evaluations of the Poincaré-extended PP0-index. For a finite graded poset PP1 of rank PP2 admitting an PP3-labelling,

PP4

This gives a direct combinatorial route from noncommutative flag-enumerative data to Chow-type invariants (Stump, 2024).

The same paper derives explicit PP5-positive expansions. For a loopless matroid PP6 of rank PP7,

PP8

where the sum is over maximal chains in PP9 whose label sequences have no initial descent and no double descents in the specified local sense. Likewise,

0^\hat00

with the weaker admissibility condition allowing an initial descent (Stump, 2024). These formulas yield a combinatorial proof that Chow and augmented Chow polynomials are 0^\hat01-positive, hence nonnegative, palindromic, and unimodal.

From the matroid side, the Hilbert–Poincaré series of the Chow ring and augmented Chow ring admit intrinsic recursive characterizations parallel to those of the Kazhdan–Lusztig polynomial and 0^\hat02-polynomial. For a loopless matroid 0^\hat03,

0^\hat04

while the augmented series satisfies

0^\hat05

These formulas situate Chow polynomials within a broader KLS-style incidence-algebra formalism (Ferroni et al., 2022).

3. Uniform matroids and explicit formulas

Uniform matroids are the most completely understood case. For the rank-0^\hat06 uniform matroid 0^\hat07, the ordinary and augmented Chow polynomials have explicit monomial expansions: 0^\hat08 Here 0^\hat09 is the multinomial coefficient determined by the starts of the maximal consecutive blocks of 1^\hat10 (Hoster, 2024).

The same work proves Ferroni’s conjecture by identifying these coefficients with counts of Schubert matroids of prescribed rank and cogirth, with looplessness imposed in the ordinary case. Explicitly,

1^\hat11

and

1^\hat12

and these are exactly the Schubert-matroid counts predicted by Ferroni (Hoster, 2024).

Uniform matroids also admit 1^\hat13-expansions in Eulerian terms. For the ordinary Chow polynomial,

1^\hat14

and similarly for the augmented polynomial,

1^\hat15

where 1^\hat16 is the number of permutations in 1^\hat17 with descent set 1^\hat18 (Hoster, 2024).

These formulas refine earlier Boolean-matroid identities. When 1^\hat19, the ordinary Chow polynomial becomes the Eulerian polynomial and the augmented Chow polynomial becomes the binomial Eulerian polynomial; when C={C1<<Ck<Ck+1}C=\{C_1<\dots<C_k<C_{k+1}\}0,

C={C1<<Ck<Ck+1}C=\{C_1<\dots<C_k<C_{k+1}\}1

linking Chow-type invariants to derangement and Eulerian polynomials (Hoster, 2024).

4. Positivity, unimodality, and real-rootedness

Palindromicity and unimodality are now standard baseline properties. In the matroid setting, they follow from the Kähler package for Chow rings and augmented Chow rings; in the poset setting they also arise from explicit C={C1<<Ck<Ck+1}C=\{C_1<\dots<C_k<C_{k+1}\}2-positive expansions and from incidence-algebra arguments that do not require a Hard Lefschetz theorem (Ferroni et al., 2022).

Real-rootedness is subtler and remains conjectural in broad generality, but several major cases are now known. For uniform matroids, the Chow polynomial and augmented Chow polynomial are real-rooted. One proof uses truncation recursions together with interlacing properties of derangement and Eulerian transforms (Brändén et al., 13 Jan 2025). A later theorem places this in a wider simplicial-poset framework: if C={C1<<Ck<Ck+1}C=\{C_1<\dots<C_k<C_{k+1}\}3 is a finite graded simplicial poset with positive C={C1<<Ck<Ck+1}C=\{C_1<\dots<C_k<C_{k+1}\}4-vector and C={C1<<Ck<Ck+1}C=\{C_1<\dots<C_k<C_{k+1}\}5 is obtained by adding a top element, then the Chow and augmented Chow polynomials of C={C1<<Ck<Ck+1}C=\{C_1<\dots<C_k<C_{k+1}\}6 are real-rooted; this class includes lattices of flats of uniform matroids (Hoster et al., 21 Aug 2025).

Real-rootedness has also been proved for a large shellable class. For UMEL-shellable posets, the Chow polynomial, augmented Chow polynomial, and C={C1<<Ck<Ck+1}C=\{C_1<\dots<C_k<C_{k+1}\}7-polynomial of the order complex all have only real and nonpositive roots, and several natural interlacing relations hold among them (Coron et al., 17 Nov 2025). A different broad framework uses lower triangular totally nonnegative matrices with diagonal entries equal to one: the associated Chow polynomials are real-rooted, and this implies real-rootedness for many posets and matroids, including projective and affine geometries, dual partition and Dowling lattices, perfect matroid designs, and paving matroids (Brändén et al., 22 Sep 2025).

There are also limitations. For weakly ranked posets, one can always realize the Chow polynomial as the Hilbert–Poincaré series of a graded Artinian Gorenstein algebra with the Strong Lefschetz property, which implies that the coefficient sequence is an C={C1<<Ck<Ck+1}C=\{C_1<\dots<C_k<C_{k+1}\}8-sequence. However, log-concavity holds for all posets of weak rank at most C={C1<<Ck<Ck+1}C=\{C_1<\dots<C_k<C_{k+1}\}9 and fails in every higher weak rank, where explicit counterexamples exist (Schweitzer et al., 2 Jan 2026). This suggests that strong algebraic realization does not by itself force full real-rootedness or universal log-concavity.

5. Variants: augmented, dual, and recursive theories

The augmented Chow polynomial is not merely an auxiliary object. In several frameworks it is structurally parallel to the ordinary Chow polynomial and often easier to handle. For bounded graded posets, one formulation is

Ck+1=1^C_{k+1}=\hat10

and for matroids it models the Hilbert–Poincaré series of the augmented Chow ring (Brändén et al., 13 Jan 2025).

A more recent development is the dual Chow polynomial. Given a kernel Ck+1=1^C_{k+1}=\hat11, the dual Chow function is defined as the Chow function associated to the sign-twisted reverse kernel Ck+1=1^C_{k+1}=\hat12. For the characteristic kernel on a weakly ranked poset, this yields a new invariant that usually differs from the ordinary Chow polynomial. In the bounded case it again specializes to the Ck+1=1^C_{k+1}=\hat13-entry (Caiolo et al., 27 May 2026).

For the characteristic kernel, the dual Chow polynomial admits a chain formula. If Ck+1=1^C_{k+1}=\hat14 is bounded of rank Ck+1=1^C_{k+1}=\hat15,

Ck+1=1^C_{k+1}=\hat16

It also satisfies symmetry and, under Möbius-sign conditions such as those holding for Cohen–Macaulay posets, nonnegativity and unimodality. For matroids, dual Chow polynomials admit deletion formulas and explicit uniform-matroid formulas; in particular, the dual Chow polynomial and dual augmented Chow polynomial of Ck+1=1^C_{k+1}=\hat17 are real-rooted (Caiolo et al., 27 May 2026).

Ordinary Chow polynomials also satisfy product and decomposition formulas. For direct sums of matroids,

Ck+1=1^C_{k+1}=\hat18

and the augmented analogue has the same form with Ck+1=1^C_{k+1}=\hat19 replaced by the augmented series. These identities arise from actual graded module decompositions of Chow rings and augmented Chow rings (Pielasa, 13 Nov 2025).

6. Geometric, polyhedral, and enumerative interfaces

Several papers place Chow polynomials in explicitly geometric settings. For the braid matroid χP,C(q)=i=1kχ[Ci,Ci+1](q),\overline{\chi}_{P,C}(q)=\prod_{i=1}^k \overline{\chi}_{[C_i,C_{i+1}]}(q),0 with respect to the maximal building set, the Chow polynomial is

χP,C(q)=i=1kχ[Ci,Ci+1](q),\overline{\chi}_{P,C}(q)=\prod_{i=1}^k \overline{\chi}_{[C_i,C_{i+1}]}(q),1

and its exponential generating function χP,C(q)=i=1kχ[Ci,Ci+1](q),\overline{\chi}_{P,C}(q)=\prod_{i=1}^k \overline{\chi}_{[C_i,C_{i+1}]}(q),2 is characterized by

χP,C(q)=i=1kχ[Ci,Ci+1](q),\overline{\chi}_{P,C}(q)=\prod_{i=1}^k \overline{\chi}_{[C_i,C_{i+1}]}(q),3

This is obtained via a modular interpretation of the Chow groups in terms of genus-zero relative stable maps to χP,C(q)=i=1kχ[Ci,Ci+1](q),\overline{\chi}_{P,C}(q)=\prod_{i=1}^k \overline{\chi}_{[C_i,C_{i+1}]}(q),4 (Kannan et al., 28 Apr 2025).

For restrictions of reflection arrangements, the Chow polynomial is the Hilbert–Poincaré series of the standard matroid Chow ring. In type χP,C(q)=i=1kχ[Ci,Ci+1](q),\overline{\chi}_{P,C}(q)=\prod_{i=1}^k \overline{\chi}_{[C_i,C_{i+1}]}(q),5, the paper gives an explicit inversion-sequence formula, while for the intermediate arrangements χP,C(q)=i=1kχ[Ci,Ci+1](q),\overline{\chi}_{P,C}(q)=\prod_{i=1}^k \overline{\chi}_{[C_i,C_{i+1}]}(q),6 between type χP,C(q)=i=1kχ[Ci,Ci+1](q),\overline{\chi}_{P,C}(q)=\prod_{i=1}^k \overline{\chi}_{[C_i,C_{i+1}]}(q),7 and χP,C(q)=i=1kχ[Ci,Ci+1](q),\overline{\chi}_{P,C}(q)=\prod_{i=1}^k \overline{\chi}_{[C_i,C_{i+1}]}(q),8, the Chow polynomials vary arithmetically: χP,C(q)=i=1kχ[Ci,Ci+1](q),\overline{\chi}_{P,C}(q)=\prod_{i=1}^k \overline{\chi}_{[C_i,C_{i+1}]}(q),9 This provides a rare linear interpolation phenomenon for Chow-type invariants (Degen et al., 16 Nov 2025).

A polyhedral version appears for vertex posets of convex polytopes. Under a stratification hypothesis on the vertex relation induced by a generic linear functional, the Chow polynomial of an interval in the resulting vertex poset agrees with the rk(P)>0\operatorname{rk}(P)>00-polynomial of the dual monotone path polytope: rk(P)>0\operatorname{rk}(P)>01 This identifies a poset-theoretic Chow polynomial with a face-enumerative polytope invariant (Michałek et al., 30 Apr 2026).

The coefficients themselves have recently been studied probabilistically. If

rk(P)>0\operatorname{rk}(P)>02

then normalizing the coefficients defines a probability distribution on rk(P)>0\operatorname{rk}(P)>03. From this viewpoint one obtains moment inequalities, bounds on roots, bounds on numbers of flags of flats, and Chern-number inequalities. In particular, for any matroid of rank rk(P)>0\operatorname{rk}(P)>04,

rk(P)>0\operatorname{rk}(P)>05

with equality if and only if rk(P)>0\operatorname{rk}(P)>06 or the simplification of the matroid is Boolean (Cheng et al., 23 Mar 2026).

Taken together, these developments suggest that Chow polynomials are not merely Hilbert series of particular rings. They function as a unifying invariant across matroids, graded posets, shellable and simplicial structures, reflection arrangements, monotone path polytopes, and toric or wonderful compactifications, while retaining a remarkably rigid package of symmetry, rk(P)>0\operatorname{rk}(P)>07-positivity, and, in many important cases, real-rootedness (Ferroni et al., 2024).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Chow Polynomial.