arXiv:2311.01397 [math.CO]AbstractReferencesReviewsResources
Schubert matroids, Delannoy paths, and Speyer's invariant
Published 2023-11-02Version 1
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.
Comments: 20 pages. 1 ancillary file. To appear in Combinatorial Theory
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2203.07770 [math.CO] (Published 2022-03-15)
On Delannoy paths without peaks and valleys
arXiv:2004.01370 [math.CO] (Published 2020-04-02)
Sequences: Polynomial, C-finite, Holonomic, ...
arXiv:1904.06630 [math.CO] (Published 2019-04-14)
Flagged $(\mathcal{P},ρ)$-partitions