Search arXivSearch

arXiv · 2506.06109

A construction that preserves the configuration of a matroid, with applications to lattice path matroids

Abstract

The configuration of a matroid $M$ 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 $M$, and stronger invariants (notably, the $\mathcal{G}$-invariant), from the configuration. Given a matroid $M$ in which certain pairs of cyclic flats are non-modular, we show how to produce a matroid that is not isomorphic to $M$ but has the same configuration as $M$. 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 $[n]$ 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. We treat constructions that yield matroids with different configurations where each matroid is determined by its configuration and all have the same $\mathcal{G}$-invariant. We also show that for any lattice $L$ other than a chain, there are non-isomorphic transversal matroids that have the same configuration and where the lattices of cyclic flats are isomorphic to $L$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph E. Bonin, Anna de Mier. 2025-12-16. A construction that preserves the configuration of a matroid, with applications to lattice path matroids. https://arxiv.org/abs/2506.06109

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO