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

MaRDI QIDQ743663zbMATHFDO

Authors 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Tutte polynomialmatroid theoryperfect matroid designscyclic flats

Mathematics Subject Classification ID

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

Abstract: We show how the Tutte polynomial of a matroid $M$ 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 $M$ 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.

Recommendations

• Tutte polynomials of perfect matroid designs
• The lattice of cyclic flats of a matroid
• The Tutte polynomial of some matroids
• The Tutte polynomial via lattice point counting
• Tutte polynomials computable in polynomial time

Cites work

• A convolution formula for the Tutte polynomial
• Counting polynomials for linear codes, hyperplane arrangements, and matroids
• Counting with groups and rings.
• The Tutte polynomial. I: General theory
• The lattice of cyclic flats of a matroid
• Tutte polynomials of perfect matroid designs

Cited in

(12)

• The free \(m\)-cone of a matroid and its \({\mathcal{G}} \)-invariant
• Matroids with different configurations and the same \(\mathcal{G} \)-invariant
• The Tutte polynomial via lattice point counting
• Cyclotomic and simplicial matroids
• The cyclic flats of a \(q\)-matroid
• The lattice of cyclic flats of a matroid
• The \(\mathcal{G}\)-invariant and catenary data of a matroid
• The Natural Matroid of an Integer Polymatroid
• Tutte polynomials of perfect matroid designs
• Connectivity gaps among matroids with the same enumerative invariants
• Cyclic flats and corners of the linking polynomial
• Cyclic flats of binary matroids

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)