For graphic and cographic matroids, the derivative g'_M(-1) equals (-1)^{c(M)-1} c(M), and computational data suggests many new properties of the coefficient N2.
Schubert matroids, Delannoy paths, and Speyer's invariant
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We provide a combinatorial way of computing Speyer's $g$-polynomial on arbitrary Schubert matroids via the enumeration of certain Delannoy paths. We define a new statistic of a basis in a matroid, and express the $g$-polynomial of a Schubert matroid in terms of it and internal and external activities. Some surprising positivity properties of the $g$-polynomial of Schubert matroids are deduced from our expression. Finally, we combine our formulas with a fundamental result of Derksen and Fink to provide an algorithm for computing the $g$-polynomial of an arbitrary matroid.
citation-role summary
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Graph theoretic properties of Speyer's matroid polynomial $g_M(t)$
For graphic and cographic matroids, the derivative g'_M(-1) equals (-1)^{c(M)-1} c(M), and computational data suggests many new properties of the coefficient N2.