Clonal cores and flexipaths in matroids
Abstract
A partitioned matroid (M, \X1,X2,…,Xn\) consists of a matroid M and a partition \X1,X2,…,Xn\ of its ground set. As such structures arise frequently in structural matroid theory, this paper introduces a general technique for analyzing those special properties of partitioned matroids that depend solely on the values of the connectivities λ(Xi), the local connectivities (j∈ JXj, k∈ KXk,), and the dual local connectivities *(h∈ HXh, g∈ GXg). In particular, we consider those partitioned matroids in which each Xi is an independent, coindependent set of clones of cardinality λ(Xi). Calling such partitioned matroids clonal-core matroids, we show that special results of the above type for partitioned matroids can be verified in general by proving them just for clonal-core matroids. Aiming at the long-term goal of finding the unavoidable minors of 4-connected matroids, we illustrate this technique by studying 4-paths. These are sequences (L,P1,P2,…, Pn,R) of sets that partition the ground set of a matroid so that the union of any proper initial segment of parts is 4-separating. Viewing the ends L and R as fixed, we call such a partition a 4-flexipath if (L,Q1,Q2,…, Qn,R) is a 4-path for all permutations (Q1,Q2,…, Qn) of (P1,P2,…, Pn). A straightforward simplification enables us to focus on (4,c)-flexipaths for some c in \1,2,3\, that is, those 4-flexipaths for which λ(Qi) = c and λ(Qi Qj) > c for all distinct i and j. Our main result for 4-paths is that the only non-trivial case that arises here is when c=2. In that case, there are essentially only two possible dual pairs of (4,c)-flexipaths when n 5.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.