Chow classes of matroids and standard Young tableaux
Jon Pål Hamre, Benjamin Schröter, Lorenzo Vecchi, Emil Verkama
TL;DR
This work develops a purely combinatorial approach to Chow classes of matroids in Grassmannians, reducing computations to snake matroids and extending to all matroids via valuativity. A central achievement is identifying the Poincaré dual of the Chow class of a snake matroid with the ribbon Schur function, which yields explicit Schubert coefficients as counts of standard Young tableaux with prescribed descent sets and recovers known uniform-matroid formulas. The paper then extends these results to lattice-path matroids, derives determinant and LR-structure formulas, and derives impactful applications, including RS-K volume interpretations and Gessel–Viennot-type counting formulas, as well as new positivity results for paving matroids. The framework also provides practical computational tools (via the K-class viewpoint) and opens numerous open problems, notably in positroids, nonnegativity, and the relation between volume and the beta-invariant.
Abstract
We study the Chow classes of arbitrary matroids in the Grassmannian. We develop a new combinatorial approach for computing them, by first focusing on snake matroids and then extending our results via valuativity to any matroid. Our main contribution identifies the Poincaré dual of the Chow class of a snake matroid with a specific ribbon Schur function, providing an explicit formula for its coefficients in the Schubert basis as the number of standard Young tableaux of a given shape with a prescribed descent set. This agrees with a formula by Klyachko for the uniform matroid. As consequences, we recover and simplify classical results such as Gessel and Viennot's enumeration of permutations with fixed descent sets, and formulas for the volume of lattice path matroids. Furthermore, we demonstrate the power of our findings by proving that certain Schubert coefficients are positive for all connected paving matroids.
