Computing the Tutte polynomial of a matroid from its lattice of cyclic flats
The electronic journal of combinatorics, Tome 21 (2014) no. 3
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 similiar statements for perfect matroid designs and near designs due to Brylawski (1980) and help to understand families of matroids with identical Tutte polynomials as constructed by Giménez and later improved by Shoda (2012).
DOI :
10.37236/4610
Classification :
05B35, 05C31
Mots-clés : matroid theory, Tutte polynomial, cyclic flats, perfect matroid designs
Mots-clés : matroid theory, Tutte polynomial, cyclic flats, perfect matroid designs
Affiliations des auteurs :
Jens Niklas Eberhardt  1
@article{10_37236_4610,
author = {Jens Niklas Eberhardt},
title = {Computing the {Tutte} polynomial of a matroid from its lattice of cyclic flats},
journal = {The electronic journal of combinatorics},
year = {2014},
volume = {21},
number = {3},
doi = {10.37236/4610},
zbl = {1301.05056},
url = {http://geodesic.mathdoc.fr/articles/10.37236/4610/}
}
Jens Niklas Eberhardt. Computing the Tutte polynomial of a matroid from its lattice of cyclic flats. The electronic journal of combinatorics, Tome 21 (2014) no. 3. doi: 10.37236/4610
Cité par Sources :