The $\mathcal{G}$-invariant and catenary data of a matroid
Joseph E. Bonin, Joseph P.S. Kung

TL;DR
This paper demonstrates that the catenary data of a matroid encapsulates the same information as its $ ext{G}$-invariant, establishing new methods to compute and analyze matroid invariants and their structural properties.
Contribution
It shows that the catenary data and the $ ext{G}$-invariant are equivalent representations of a matroid's information, extending known results of the Tutte polynomial to the $ ext{G}$-invariant.
Findings
Catenary data contains the same information as the $ ext{G}$-invariant.
Many matroid invariants can be derived from the $ ext{G}$-invariant.
The $ ext{G}$-invariant can be reconstructed from restrictions and certain matroid decompositions.
Abstract
The catenary data of a matroid of rank on elements is the vector , indexed by compositions , where ,\, for , and , with the coordinate equal to the number of maximal chains or flags of flats or closed sets such that has rank ,\, , and . We show that the catenary data of contains the same information about as its -invariant, which was defined by H. Derksen [\emph{J.\ Algebr.\ Combin.}\ 30 (2009) 43--86]. The Tutte polynomial is a specialization of the -invariant. We show that many known results for the Tutte polynomial have analogs for the -invariant. In particular, we show that for many matroid constructions, the…
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 Combinatorial Mathematics · Algebraic structures and combinatorial models · graph theory and CDMA systems
