Computing the Tutte polynomial of a matroid from its lattice of cyclic flats
From MaRDI portal
Publication:743663
zbMATH Open1301.05056arXiv1407.6666MaRDI QIDQ743663FDOQ743663
Authors: Jens Niklas Eberhardt
Publication date: 30 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: We show how the Tutte polynomial of a matroid can be computed from its condensed configuration, which is a statistic of its lattice of cyclic flats. The results imply that the Tutte polynomial of is already determined by the abstract lattice of its cyclic flats together with their cardinalities and ranks. They furthermore generalize a similiar statement for perfect matroid designs due to Mphako and help to understand families of matroids with identical Tutte polynomial as constructed by Ken Shoda.
Full work available at URL: https://arxiv.org/abs/1407.6666
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cites Work
Cited In (12)
- The Tutte polynomial via lattice point counting
- Connectivity gaps among matroids with the same enumerative invariants
- Cyclic flats and corners of the linking polynomial
- The cyclic flats of a \(q\)-matroid
- Cyclotomic and simplicial matroids
- The Natural Matroid of an Integer Polymatroid
- Tutte polynomials of perfect matroid designs
- The \(\mathcal{G}\)-invariant and catenary data of a matroid
- Matroids with different configurations and the same \(\mathcal{G} \)-invariant
- The lattice of cyclic flats of a matroid
- Cyclic flats of binary matroids
- The free \(m\)-cone of a matroid and its \({\mathcal{G}} \)-invariant
This page was built for publication: Computing the Tutte polynomial of a matroid from its lattice of cyclic flats
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743663)