Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2511.01711

Chow classes of matroids and standard Young tableaux

Jon Pål Hamre·Benjamin Schröter·Lorenzo Vecchi·Emil Verkama
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

math.COmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jon Pål Hamre, Benjamin Schröter, Lorenzo Vecchi, Emil Verkama. 2025-11-20. Chow classes of matroids and standard Young tableaux. https://arxiv.org/abs/2511.01711

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗