Computing the Tutte polynomial of a matroid from its lattice of cyclic flats

zbMath1301.05056arXiv1407.6666MaRDI QIDQ743663

Jens Niklas Eberhardt

Publication date: 30 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.6666

zbMATH Keywords

Tutte polynomialmatroid theoryperfect matroid designscyclic flats

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

Matroids with different configurations and the same \(\mathcal{G} \)-invariant ⋮ Connectivity gaps among matroids with the same enumerative invariants ⋮ The Natural Matroid of an Integer Polymatroid ⋮ The \(\mathcal{G}\)-invariant and catenary data of a matroid ⋮ Cyclic flats of binary matroids ⋮ The free \(m\)-cone of a matroid and its \({\mathcal{G}} \)-invariant

Cites Work

• The lattice of cyclic flats of a matroid
• A convolution formula for the Tutte polynomial
• Counting polynomials for linear codes, hyperplane arrangements, and matroids
• Tutte Polynomials of Perfect Matroid Designs
• The Tutte Polynomial Part I: General Theory
• Counting with groups and rings.

This page was built for publication: Computing the Tutte polynomial of a matroid from its lattice of cyclic flats