The omega invariant of a matroid
Alex Fink, Kris Shaw, David E Speyer

TL;DR
This paper introduces and studies the omega-invariant, the highest-degree coefficient of the g-polynomial of a matroid, establishing conditions for its nonnegativity and providing formulas and computations for special cases.
Contribution
It defines the omega-invariant of a matroid, explores its properties, and offers simplified formulas and explicit calculations for specific cases.
Findings
Omega-invariant is nonnegative under certain connectivity and minor conditions.
Provides simplified formulas for computing omega-invariant.
Calculates omega-invariant for cases with small rank or small difference between size and rank.
Abstract
The third author introduced the -polynomial of a matroid, a covaluative matroid statistic which is unchanged under series and parallel extension. The -polynomial of a rank matroid has the form . The coefficient is Crapo's classical -invariant. In this paper, we study the coefficient , which we term the -invariant of . We show that, if is connected for every proper flat of , and is nonnegative for every minor of , then all the coefficients of are nonnegative. We give several simplified versions of Ferroni's formula for , and compute when or is small.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Fuzzy and Soft Set Theory
