A Note on Extension Properties and Representations of Matroids
Michael Bamiloshin, Oriol Farràs, Carles Padró
TL;DR
The paper unifies extension-property approaches to classify small matroids and polymatroids by their representability across linear, folded-linear, algebraic, and entropic frameworks, using both theoretical results (e.g., generalized Euclidean, Ingleton-Main, Dress-Lovász, Ahlswede-Körner) and computer-aided explorations. It introduces a common information–extension framework for matroids and polymatroids, and applies it to identify new non-linearly representable matroids, with a deep focus on sparse paving matroids and tic-tac-toe configurations, including a detailed analysis of the $T^3$ family and its nine-element counterparts. The work provides human-readable proofs for several non-GE cases, enumerates 181 nine-element TTT matroids, and describes two maximal relaxations with precise representability properties across characteristics, thereby clarifying the boundary between linear, algebraic, and almost entropic matroids and illustrating duality-related limits. Overall, the results advance understanding of how extension properties constrain representations, offering computational tools and datasets that inform secret-sharing and information-theoretic perspectives in matroid theory.
Abstract
We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic representations. Iterations of those extension properties are checked for matroids on eight and nine elements by means of computer-aided explorations, finding in that way several new examples of non-linearly representable matroids. A special emphasis is made on sparse paving matroids on nine points containing the tic-tac-toe configuration. We present a new, more clear description of that family and we analyze extension properties on those matroids and their duals.
