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

MaRDI QIDQ743663zbMATH OpenFDO

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, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i3p47

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

cyclic flatsmatroid theoryperfect matroid designsTutte polynomial

Mathematics Subject Classification ID

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

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 lattice of cyclic flats of a matroid
• The Tutte polynomial. I: General theory
• Tutte polynomials of perfect matroid designs

Cited in

(13)

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

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)