Clonal cores and flexipaths in matroids

TL;DR

The paper introduces a general technique to analyze partitioned matroids by reducing to clonal-core matroids, where each block $X_i$ is represented by an independent, coindependent clone set of size $λ(X_i)$. This reduction preserves key connectivity measures, enabling universal arguments (Theorem G4) to be verified in the restricted clonal-core setting and extended to all partitioned matroids. Focusing on 4-paths, it classifies $(4,c)$-flexipaths and proves that, for $c=2$, the rich family of structures collapses, up to duality, into essentially two dual configurations when $n≥5$, with a comprehensive taxonomy for smaller $n$. The framework provides a powerful, broadly applicable method in structural matroid theory for deriving unavoidable-minor results in 4-connected matroids and facilitates systematic, constructive classifications of complex path-like decompositions.

Abstract

A partitioned matroid $(M, \{X_1,X_2,\dots,X_n\})$ consists of a matroid $M$ and a partition $\{X_1,X_2,\dots,X_n\}$ 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 $λ(X_i)$, the local connectivities $\sqcap(\cup_{j\in J}X_j, \cup_{k\in K}X_k,)$, and the dual local connectivities $\sqcap^*(\cup_{h\in H}X_h, \cup_{g\in G}X_g)$. In particular, we consider those partitioned matroids in which each $X_i$ is an independent, coindependent set of clones of cardinality $λ(X_i)$. 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,P_1,P_2,\ldots, P_n,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,Q_1,Q_2,\ldots, Q_n,R)$ is a $4$-path for all permutations $(Q_1,Q_2,\ldots, Q_n)$ of $(P_1,P_2,\ldots, P_n)$. 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 $λ(Q_i) = c$ and $λ(Q_i \cup Q_j) > 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 \ge 5$.

Figures (3)

• Figure 1: (i) A rank-$7$ matroid with a spike-reminiscent flexipath $(L, Q_1, Q_2, Q_3, Q_4, R)$. (ii) A rank-$7$ matroid with a paddle-reminiscent flexipath $(L, Q_1, Q_2, Q_3, Q_4, R)$.
• Figure 2: A rank-$7$ matroid in which $\{a, b\}$ is a specially placed step in the flexipath $(L, Q_1, Q_2, \{a, b\}, Q_3, Q_4, R)$.
• Figure 3: A prism-like flexipath $(L, Q_1, Q_2, Q_3, R)$.

Theorems & Definitions (98)

• Theorem 1.1
• Lemma 2.1
• Lemma 2.2
• Lemma 2.3
• proof
• Lemma 3.1
• Theorem 3.2
• Lemma 3.3
• proof
• Lemma 3.4