Papers
Topics
Authors
Recent
2000 character limit reached

Schubert matroids, Delannoy paths, and Speyer's invariant

Published 2 Nov 2023 in math.CO | (2311.01397v1)

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.

Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.