A construction that preserves the configuration of a matroid, with applications to lattice path matroids
Joseph E. Bonin, Anna de Mier

TL;DR
This paper introduces a construction that alters a matroid's configuration without changing its invariants, explores its application to lattice path matroids, and discusses conditions under which matroids are uniquely determined by their configuration.
Contribution
It presents a method to produce non-isomorphic matroids with identical configurations and invariants, and characterizes when lattice path matroids are uniquely determined by their configuration.
Findings
The construction applies to non-fundamental transversal lattice path matroids.
Most lattice path matroids are not Tutte unique asymptotically.
Conditions are provided for matroids to be determined by their configuration.
Abstract
The configuration of a matroid is the abstract lattice of cyclic flats (flats that are unions of circuits) where we record the size and rank of each cyclic flat, but not the set. One can compute the Tutte polynomial of , and stronger invariants (notably, the -invariant), from the configuration. Given a matroid in which certain pairs of cyclic flats are non-modular, we show how to produce a matroid that is not isomorphic to but has the same configuration as . We show that this construction applies to a lattice path matroid if and only if it is not a fundamental transversal matroid, and we enumerate the connected lattice path matroids on that are fundamental; these results imply that, asymptotically, almost no lattice path matroids are Tutte unique. We give a sufficient condition for a matroid to be determined, up to isomorphism, by its configuration.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Advanced Combinatorial Mathematics
