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

Summary: 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 \textit{T. Brylawski} [``The Tutte polynomial. I: General theory'', CIME Summer Sch. 83, 125--275 (2010; Zbl 1302.05023)] and help to understand families of matroids with identical Tutte polynomials as constructed by \textit{O. Giménez} [unpublished work] and later improved by \textit{K. Shoda} [Large families of matroids with the same Tutte polynomial. Washington, D.C.: George Washington University (PhD thesis) (2012)].