Year: 2026
Type: preprint
Abstract: We prove that, if $X$ is a four-element independent set in a vertically $5$-connected representable matroid $M$, then either there is a circuit of $M$ that contains at least three elements of $X$, or there is a representation $A$ of $M$ such that each column of $A$ has at most two non-zero elements and each of the columns indexed by $X$ has exactly one non-zero element. We also prove a version of this result without the connectivity assumptions.
Source: arXiv (Cornell University)
Authors: Geelen, Jim, Gerards, Bert, Whittle, Geoff
Institution: University of Waterloo
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7235786041
