Search arXivSearch

arXiv · 2405.15207

Clonal cores and flexipaths in matroids

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$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nick Brettell, James Oxley, Charles Semple, Geoff Whittle. 2025-04-15. Clonal cores and flexipaths in matroids. https://arxiv.org/abs/2405.15207

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

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO