Chow functions for partially ordered sets
Pith reviewed 2026-05-23 17:29 UTC · model grok-4.3
The pith
Chow functions on arbitrary posets are unimodal and positive without Hard Lefschetz theorems.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
To each kernel in a given poset the authors associate a polynomial called the Chow function. This function satisfies unimodality and positivity properties and provides natural polynomial analogs of graded module decompositions that appear in algebraic geometry, even for posets that lack any geometric realization or known Hard Lefschetz theorem. The framework thereby places several positivity and real-rootedness conjectures from polytopes, matroids, and Coxeter groups on common combinatorial ground.
What carries the argument
The Chow function, a polynomial associated to a kernel on a poset that encodes graded combinatorial data and carries the positivity and unimodality claims.
If this is right
- Coefficients of the relevant polynomials on face lattices of polytopes are unimodal and positive.
- Hilbert-Poincaré series of matroid Chow rings satisfy the same positivity and unimodality properties.
- Flag enumerations on Bruhat intervals of Coxeter groups are governed by the same kernel-based positivity.
- The results hold for arbitrary posets and do not require any version of the Hard Lefschetz theorem.
Where Pith is reading between the lines
- The kernel construction could be applied to other combinatorial posets such as those arising from graphs or hyperplane arrangements to generate new families of positive polynomials.
- The unification suggests that proofs of the listed conjectures might reduce to verifying that a particular kernel satisfies the abstract Chow-function axioms.
- If the framework extends to q-analogs or other deformations, it could produce real-rootedness statements beyond the cases already connected.
Load-bearing premise
A kernel on an arbitrary poset admits a well-defined Chow function whose coefficients are unimodal and positive independently of any geometric realization.
What would settle it
An explicit poset and kernel whose associated Chow function has a coefficient sequence that is neither unimodal nor nonnegative would falsify the general claims.
Figures
read the original abstract
Three decades ago, Stanley and Brenti initiated the study of the Kazhdan--Lusztig--Stanley (KLS) functions, putting on common ground several polynomials appearing in algebraic combinatorics, discrete geometry, and representation theory. In the present paper we develop a theory that parallels the KLS theory. To each kernel in a given poset, we associate a polynomial function that we call the \emph{Chow function}. The Chow function often exhibits remarkable properties, and sometimes encodes the graded dimensions of a cohomology or Chow ring. The framework of Chow functions provides natural polynomial analogs of graded module decompositions that appear in algebraic geometry, but that work for arbitrary posets, even when no graded module decomposition is known to exist. In this general framework, we prove a number of unimodality and positivity results without relying on versions of the Hard Lefschetz theorem. Our framework shows that there is an unexpected relation between positivity and real-rootedness conjectures about chains on face lattices of polytopes by Brenti and Welker, Hilbert--Poincar\'e series of matroid Chow rings by Ferroni and Schr\"oter, and flag enumerations on Bruhat intervals of Coxeter groups by Billera and Brenti.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper develops a general theory of Chow functions associated to kernels on arbitrary posets, paralleling the Kazhdan--Lusztig--Stanley theory. It defines these polynomial functions, shows they often encode graded dimensions of cohomology or Chow rings, provides polynomial analogs of graded module decompositions that apply even without geometric realizations, and proves unimodality and positivity results without invoking Hard Lefschetz theorems. The framework is used to relate positivity and real-rootedness conjectures on chains in face lattices of polytopes (Brenti--Welker), Hilbert--Poincaré series of matroid Chow rings (Ferroni--Schröter), and flag enumerations on Bruhat intervals (Billera--Brenti).
Significance. If the central claims hold, the work supplies a purely combinatorial framework that unifies several longstanding positivity and unimodality phenomena across algebraic combinatorics, discrete geometry, and representation theory while avoiding geometric hypotheses such as Hard Lefschetz. The explicit connection drawn among the three families of conjectures is a substantive contribution; the construction of Chow functions from kernels on general posets is a strength that extends beyond the geometric cases where such polynomials were previously studied.
major comments (2)
- [§3] §3 (definition of Chow function from kernel): the construction is stated to be well-defined for arbitrary posets and to satisfy the claimed positivity/unimodality independently of any geometric realization, but the proof that the coefficients remain nonnegative when the kernel is merely combinatorial (no Hard Lefschetz input) is not yet verified against the three families of conjectures; a concrete check on a small Bruhat interval or matroid would strengthen the unification claim.
- [Theorem 5.2] Theorem 5.2 (relation among the three conjectures): the statement that the Chow-function framework implies an 'unexpected relation' between the Brenti--Welker, Ferroni--Schröter, and Billera--Brenti conjectures requires an explicit reduction showing that each conjecture is equivalent to a positivity statement for a suitable kernel; the current argument appears to rely on the existence of the Chow function rather than deriving the conjectures from it.
minor comments (2)
- [Abstract / §1] The abstract and introduction use 'kernel' without an immediate forward reference to its precise definition; adding the definition or a pointer in the first paragraph would improve readability.
- [§2] Notation for the Chow function (e.g., whether it is denoted C_P or something else) should be fixed consistently from the first appearance onward.
Simulated Author's Rebuttal
We thank the referee for the careful reading, positive assessment, and recommendation of minor revision. The comments highlight opportunities to strengthen the exposition of the combinatorial positivity results and the explicit connections among the conjectures. We respond to each major comment below.
read point-by-point responses
-
Referee: [§3] §3 (definition of Chow function from kernel): the construction is stated to be well-defined for arbitrary posets and to satisfy the claimed positivity/unimodality independently of any geometric realization, but the proof that the coefficients remain nonnegative when the kernel is merely combinatorial (no Hard Lefschetz input) is not yet verified against the three families of conjectures; a concrete check on a small Bruhat interval or matroid would strengthen the unification claim.
Authors: We agree that an explicit low-dimensional verification would make the independence from geometric hypotheses more tangible. In the revised version we will insert a new computational example immediately after the definition in §3, computing the Chow function for the Bruhat interval [e, w] with w a length-6 permutation in S_4. The kernel is defined purely combinatorially from the poset structure, and the resulting coefficients are verified to be nonnegative by direct expansion, providing a concrete check for the Billera–Brenti family without invoking Hard Lefschetz. revision: yes
-
Referee: [Theorem 5.2] Theorem 5.2 (relation among the three conjectures): the statement that the Chow-function framework implies an 'unexpected relation' between the Brenti--Welker, Ferroni--Schröter, and Billera--Brenti conjectures requires an explicit reduction showing that each conjecture is equivalent to a positivity statement for a suitable kernel; the current argument appears to rely on the existence of the Chow function rather than deriving the conjectures from it.
Authors: The argument in Theorem 5.2 does construct, for each of the three settings, an explicit kernel on the corresponding poset whose Chow function encodes the relevant positivity statement. To address the concern, we will expand the proof by adding three short paragraphs (one per conjecture) that spell out the kernel construction and the precise equivalence between the conjectured nonnegativity and the nonnegativity of the associated Chow function. These additions will make the reductions fully explicit while leaving the logical structure unchanged. revision: yes
Circularity Check
No significant circularity detected
full rationale
The paper introduces a general construction of Chow functions from kernels on arbitrary posets, then derives unimodality and positivity statements directly within this framework without invoking Hard Lefschetz or geometric realizations. The cited relations to prior conjectures (including the self-citation to Ferroni-Schröter) are presented as consequences of the new theory rather than load-bearing inputs or definitions. No equation, ansatz, or uniqueness claim reduces by construction to a fitted parameter or prior self-result; the derivation chain remains self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Every poset admits kernels to which a polynomial function (Chow function) can be associated in a manner parallel to KLS theory.
- domain assumption Unimodality and positivity of the resulting polynomials can be established combinatorially without geometric input or Hard Lefschetz theorems.
invented entities (1)
-
Chow function
no independent evidence
Lean theorems connected to this paper
-
IndisputableMonolith.Cost.FunctionalEquationwashburn_uniqueness_aczel echoes?
echoesECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.
To each kernel in a given poset, we associate a polynomial function that we call the Chow function. ... H_st(x) = x^{ρ_st-1} H_st(x^{-1}) ... numerical canonical decomposition ... H_st(x) = (g^rev_st - g_st)/(x-1) + sum ...
-
IndisputableMonolith.Foundation.RealityFromDistinctionreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Theorem 1.1 ... If the right KLS function f or the left KLS function g is non-negative, then the Chow function H is non-negative and unimodal.
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.
Forward citations
Cited by 1 Pith paper
-
Vertex Posets, Monotone Path Polytopes, and Chow Polynomials
A duality holds between positive and negative BB-type stratifications of a polytope, and the Chow polynomial of its graded vertex poset equals the h-polynomial of the dual monotone path polytope.
Reference graph
Works this paper leans on
-
[1]
[ADH23] Federico Ardila, Graham Denham, and June Huh, Lagrangian geometry of matroids, J. Amer. Math. Soc. 36 (2023), no. 3, 727–794. [Adi18] Karim Adiprasito, Combinatorial Lefschetz theorems beyond positivity , arXiv e-prints (2018), arXiv:1812.10454. [AHK18] Karim Adiprasito, June Huh, and Eric Katz, Hodge theory for combinatorial geometries, Ann. of M...
work page internal anchor Pith review Pith/arXiv arXiv 2023
-
[2]
[ANR23] Robert Angarone, Anastasia Nathanson, and Victor Reiner, Chow Rings of Matroids as Permutation Representations, arXiv e-prints (2023), arXiv:2309.14312. [Ard23] Federico Ardila-Mantilla, The geometry of geometries: matroid theory, old and new , ICM— International Congress of Mathematicians. Vol
-
[3]
©2023, pp. 4510–4541. [AT21] Christos A. Athanasiadis and Eleni Tzanaki, Symmetric decompositions, triangulations and real- rootedness, Mathematika 67 (2021), no. 4, 840–859. 46 L. FERRONI, J. P. MATHERNE, AND L. VECCHI [Ath18] Christos A. Athanasiadis, Gamma-positivity in combinatorics and geometry, S´em. Lothar. Combin. 77 ([2016–2018]), Art. B77i,
work page 2023
-
[4]
[Bac80] Kenneth Baclawski, Cohen-Macaulay ordered sets, J. Algebra 63 (1980), no. 1, 226–258. [Bay21] Margaret M. Bayer, The 𝑐𝑑-index: a survey , Polytopes and discrete geometry, Contemp. Math., vol. 764, Amer. Math. Soc., [Providence], RI,
work page 1980
-
[5]
©2021, pp. 1–19. [BB05] Anders Bj ¨orner and Francesco Brenti,Combinatorics of Coxeter groups, Graduate Texts in Mathematics, vol. 231, Springer, New York,
work page 2021
-
[6]
Billera and Francesco Brenti, Quasisymmetric functions and Kazhdan-Lusztig polynomials , Israel J
[BB11] Louis J. Billera and Francesco Brenti, Quasisymmetric functions and Kazhdan-Lusztig polynomials , Israel J. Math. 184 (2011), 317–348. [BBD+22] Charles Blundell, Lars Buesing, Alex Davies, Petar Veliˇ ckovi ´c, and Geordie Williamson, Towards combinatorial invariance for Kazhdan-Lusztig polynomials, Represent. Theory 26 (2022), 1145–1191. [BBFK02] ...
-
[7]
[Dye93] M. J. Dyer, Hecke algebras and shellings of Bruhat intervals , Compositio Math. 89 (1993), no. 1, 91–115. [EHL23] Christopher Eur, June Huh, and Matt Larson, Stellahedral geometry of matroids, Forum Math. Pi 11 (2023), Paper No. e24. [EPW16] Ben Elias, Nicholas Proudfoot, and Max Wakefield, The Kazhdan-Lusztig polynomial of a matroid , Adv. Math. ...
work page 1993
-
[8]
©2023, pp. 212–239. [Inc06] Federico Incitti, On the combinatorial invariance of Kazhdan-Lusztig polynomials, J. Combin. Theory Ser. A 113 (2006), no. 7, 1332–1350. [Inc07] Federico Incitti, More on the combinatorial invariance of Kazhdan-Lusztig polynomials , J. Combin. Theory Ser. A 114 (2007), no. 3, 461–482. [Kar04] Kalle Karu, Hard Lefschetz theorem ...
work page 2023
-
[9]
[Kar06] Kalle Karu, The 𝑐𝑑-index of fans and posets, Compos. Math. 142 (2006), no. 3, 701–718. [Kar13] Kalle Karu, On the complete cd-index of a Bruhat interval , J. Algebraic Combin. 38 (2013), no. 3, 527–541. [KL79] David Kazhdan and George Lusztig, Representations of Coxeter groups and Hecke algebras , Invent. Math. 53 (1979), no. 2, 165–184. [Lar24] M...
-
[10]
©2023, pp. 414–458. [Pat21] Leonardo Patimo, A combinatorial formula for the coefficient of𝑞 in Kazhdan-Lusztig polynomials, Int. Math. Res. Not. IMRN (2021), no. 5, 3203–3223. [PP20] Stavros Papadakis and Vasiliki Petrotou, The characteristic 2 anisotropicity of simplicial spheres, arXiv e-prints (2020), arXiv:2012.09815. [PP23] Roberto Pagaria and Gian ...
-
[11]
[Slo18] Neil J. A. Sloane, The on-line encyclopedia of integer sequences, Notices Amer. Math. Soc. 65 (2018), no. 9, 1062–1074. [Soe90] Wolfgang Soergel, Kategorie O, perverse Garben und Moduln¨uber den Koinvarianten zur Weylgruppe, J. Amer. Math. Soc. 3 (1990), no. 2, 421–445. [Sta80] Richard P. Stanley, The number of faces of a simplicial convex polytop...
work page 2018
-
[12]
Stembridge, Counterexamples to the poset conjectures of Neggers, Stanley, and Stembridge , Trans
[Ste07] John R. Stembridge, Counterexamples to the poset conjectures of Neggers, Stanley, and Stembridge , Trans. Amer. Math. Soc. 359 (2007), no. 3, 1115–1128. [Ste21] Matthew Stevens, Real-rootedness conjectures in matroid theory , 2021, Thesis (Bachelor)–Stanford University, https://mcs0042.github.io/bachelor.pdf. [Stu24] Christian Stump, Chow and augm...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.