Unlabeled equivalence for matroids representable over finite fields
S. R. Kingan
发表信息：
S. R. Kingan (2012). Unlabeled Inequivalence in representable matroids, 2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 99 - 106
We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two $r\times n$ matrices $A$ and $A'$ representing the same matroid $M$ over a field $F$ are {\it geometrically equivalent representations} of $M$ if one can be obtained from the other by elementary row operations, column scaling, and column permutations. Using geometric equivalence, we give a method for exhaustively generating non-isomorphic matroids representable over a finite field $GF(q)$, where $q$ is a power of a prime.
For each proper minor-closed subclass $\cM$ of the $\GF(q^2)$-representable matroids containing all simple $\GF(q)$-representable matroids, we give, for all large $r$, a tight upper bound on the number of points in a rank-$r$ matroid in $\cM$, and construct a rank-$r$ matroid in $\cM$ for which equality holds. As a consequence, we give a tight upper bound on the number of points in a $\GF(q^2)$-representable, rank-$r$ matroid with no $\PG(k,q^2)$-minor.
We consider the GF$(4)$-representable matroids with a circuit-hyperplane such that the matroid obtained by relaxing the circuit-hyperplane is also GF$(4)$-representable. We characterize the structure of these matroids as an application of structure theorems for the classes of $U_{2,4}$-fragile and $\{U_{2,5},U_{3,5}\}$-fragile matroids. In addition, we characterize the forbidden submatrices in GF$(4)$-representations of these matroids.
Gordon introduced a class of matroids $M(n)$, for prime $n\ge 2$, such that $M(n)$ is algebraically representable, but only in characteristic $n$. Lindström proved that $M(n)$ for general $n\ge 2$ is not algebraically representable if $n>2$ is an even number, and he conjectured that if $n$ is a composite number it is not algebraically representable. We introduce a new kind of matroid called {\it harmonic matroids}, of which full algebraic matroids are an example. We prove the conjecture in this more general case.
Let $M$ be a representable matroid, and $Q, R, S, T$ subsets of the ground set. We prove that, if $M$ is sufficiently large, then there is an element $e$ such that deleting or contracting $e$ preserves both the $Q$-$R$ and the $S$-$T$ connectivities. For matroids representable over a finite field we prove a stronger result: we show that we can remove $e$ such that both a connectivity and a minor of $M$ are preserved.
A matroid is $\text{GF}(q)$-regular if it is representable over all proper superfields of the field $\text{GF}(q)$. We show that, for highly connected matroids having a large projective geometry over $\text{GF}(q)$ as a minor, the property of $\text{GF}(q)$-regularity is equivalent to representability over both $\text{GF}(q^2)$ and $\text{GF}(q^t)$ for some odd integer $t \geq 3$. We do this by means of an exact structural description of all such matroids.
We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte's definition, using chain groups. We show how such representations behave under duality and minors, we extend Tutte's representability criterion to this new class, and we study the generator matrices of the chain groups. An example shows that the class of matroids representable over a skew partial field properly contains the class of matroids representable over a skew field. Next, we show that every multilinear representation of a ma…
We prove there is no sentence in the monadic second-order language MS0 that characterises when a matroid is representable over at least one field, and no sentence that characterises when a matroid is K-representable, for any infinite field K. By way of contrast, because Rota's Conjecture is true, there is a sentence that characterises F-representable matroids, for any finite field F.
We prove that for each prime power $q$ there is an integer $n$ such that if $M$ is a $3$-connected, representable matroid with a PG$(n-1,q)$-minor and no $U_{2,q^2+1}$-minor, then $M$ is representable over GF$(q)$. We also show that for $\ell >= 2$, if $M$ is a $3$-connected, representable matroid of sufficiently high rank with no $U_{2,\ell+2}$-minor and $|E(M)| \geq (4\ell)^{r(M)/2}$, then $M$ is representable over a field of order at most $\ell$.
A matroid is Ingleton if all quadruples of subsets of its ground set satisfy Ingleton's inequality. In particular, representable matroids are Ingleton. We show that the number of Ingleton matroids on ground set $[n]$ is doubly exponential in $n$; it follows that almost all Ingleton matroids are non-representable.
In 1984, Kelly and Oxley introduced the model of a random representable matroid $M[A_n]$ corresponding to a random matrix $A_n \in \mathbb{F}_q^{m(n) \times n}$, whose entries are drawn independently and uniformly from $\mathbb{F}_q$. Whereas properties such as rank, connectivity, and circuit size have been well-studied, forbidden minors have not yet been analyzed. Here, we investigate the asymptotic probability as $n \to \infty$ that a fixed $\mathbb{F}_q$-representable matroid $M$ is a minor of $M[A_n]$. (We always assume $m(n) \geq \text{rank}(M)$ for all sufficiently large $n$, otherwise $…
Representability of the direct sum of uniform q-matroids
Université de Rennes（雷恩大学）；University College Dublin（都柏林大学学院）；Vrije Universiteit Brussel（布鲁塞尔自由大学）；Netherlands Defence Academy（荷兰国防学院）；University of Naples Federico II（那不勒斯费德里科二世大学）；Ghent University（根特大学）；University of Campania “Luigi Vanvitelli”（坎帕尼亚路易吉·万维泰利大学）
We show that a random subset of the rank-$n$ projective geometry $\text{PG}(n-1,q)$ is, with high probability, not $(b,c)$-decomposable: if $k$ is its colouring number, it does not admit a partition of its ground set into classes of size at most $ck$, every transversal of which is $b$-colourable. This generalises recent results by Abdolazimi, Karlin, Klein, and Oveis Gharan (arXiv:2111.12436) and by Leichter, Moseley, and Pruhs (arXiv:2206.12896), who showed that $\text{PG}(n-1,q)$ is not $(1,c)$-decomposable, resp. not $(b,c)$-decomposable.
The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. Hyperbolic polynomials give rise to a class of (hyperbolic) matroids which properly contains the class of matroids representable over the complex numbers. This connection was used by the second author to construct counterexamples to algebraic (stronger) versions of the generalized Lax conjecture by considering a non-representable hyperbolic matroid. The Vámos matroid and a generalization of it are, prior to this work, the only known instances of non-representable…
We show that each real-representable matroid is a minor of a complex-representable excluded minor for real-representability. More generally, for an infinite field $\mathbb{F}_1$ and a field extension $\mathbb{F}_2$, if $\mathbb{F}_1$-representability is not equivalent to $\mathbb{F}_2$-representability, then each $\mathbb{F}_1$-representable matroid is a minor of a $\mathbb{F}_2$-representable excluded minor for $\mathbb{F}_1$-representability.
We develop some basic tools to work with representable matroids of bounded tree-width and use them to prove that, for any prime power $q$ and constant $k$, the characteristic polynomial of any loopless, $GF(q)$-representable matroid with tree-width $k$ has no real zero greater than $q^{k-1}$.
It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, since finitary infinite matroids must have non-finitary duals. In this paper we illustrate the new theory by exhibiting its implications for the cycle and bond matroids of infinite graphs. We also describe their algebraic cycle matroids, those whose circuits are the finite cycles and double rays, and determine their duals. Finally, we give a sufficient condition for a matroid to be representable in a sense adapted to …
The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a finite field k if and only if all its finite minors are representable over k. We expect that the method we use to prove this will make it possible to lift many theorems about finite matroids representable over a finite field to theorems about tame thin sums matroids over these fields. We give three examples of this: various characterisations of binary tame …
There exist several theorems which state that when a matroid is representable over distinct fields F_1,...,F_k, it is also representable over other fields. We prove a theorem, the Lift Theorem, that implies many of these results. First, parts of Whittle's characterization of representations of ternary matroids follow from our theorem. Second, we prove the following theorem by Vertigan: if a matroid is representable over both GF(4) and GF(5), then it is representable over the real numbers by a matrix such that the absolute value of the determinant of every nonsingular square submatrix is a powe…
We prove that if M is a vertically 4-connected matroid with a modular flat X of rank at least three, then every representation of M | X over a finite field F extends to a unique F-representation of M. A corollary is that when F has order q, any vertically 4-connected matroid with a PG(2, F)-restriction is either F-representable or has a U_{2, q^2+1}-minor. We also show that no excluded minor for the class of F-representable matroids has a PG(2, F)-restriction.
A frame template over a field $\mathbb F$ describes the precise way in which a given $\mathbb F$-representable matroid is close to being a frame matroid. Our main result determines the maximum-rank projective or affine geometry that is described by a given frame template over a prime field. Subject to the matroid minors hypothesis of Geelen, Gerards, and Whittle, we use our result to determine, for each projective or affine geometry $N$ over a prime field $\mathbb F$, a best-possible upper bound on the number of elements in a simple $\mathbb F$-representable matroid $M$ of sufficiently large r…
We relate two conjectures that play a central role in the reported proof of Rota's Conjecture. Let $\mathbb F$ be a finite field. The first conjecture states that: the branch-width of any $\mathbb F$-representable $N$-fragile matroid is bounded by a function depending only upon $\mathbb F$ and $N$. The second conjecture states that: if a matroid $M_2$ is obtained from a matroid $M_1$ by relaxing a circuit-hyperplane and both $M_1$ and $M_2$ are $\mathbb F$-representable, then the branch-width of $M_1$ is bounded by a function depending only upon $\mathbb F$. Our main result is that the second …
It is proved that, for a prime number $p$, showing that an $n$-element matroid is not representable over $GF(p)$ requires only $O(n^2)$ rank evaluations.
Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given bi-uniform matroid has not been proved. The interest of these problems is due to their implications to secret sharing. The existence of efficient methods to find representations for all bi-uniform matroids is proved here for the first time. The previously known efficient constructions apply only to a particular class of bi-uniform matroids, while the known genera…
The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and hyperfields. Using deep results due to Tutte, Dress-Wenzel, and Gelfand-Rybnikov-Stone, we give a presentation for the foundation of a matroid in terms of generators and relations. The generators are certain "cross-ratios" generalizing the cross-ratio of four points on a projective line, and the relations encode dependencies between cross-ratios in certain low-rank co…
Research and Education Institute for Semiconductors and Informatics, Kumamoto University（熊本大学半导体与信息学研究与教育学院）；Graduate School of Science and Technology, Kumamoto University（熊本大学理工学研究科）
This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be representable. Still, one may apply linear algebraic constructions to non-representable matroids. There are a number of different definitions of matroids, a phenomenon known as cryptomorphism. In this survey, we begin by reviewing the classical definitions of matroids, develop operations in matroid theory, summarize some results in representability, and construc…
The first problem we investigate is the following: given $k\in \mathbb{R}_{\ge 0}$ and a vector $v$ of Plücker coordinates of a point in the real Grassmannian, is the vector obtained by taking the $k$th power of each entry of $v$ again a vector of Plücker coordinates? For $k\neq 1$, this is true if and only if the corresponding matroid is regular. Similar results hold over other fields. We also describe the subvariety of the Grassmannian that consists of all the points that define a regular matroid. The second topic is a related problem for arithmetic matroids. Let $\mathcal{A} = (E, rk, m)$ b…
We prove that for each finite field $\mathbb F$ and integer $k\in \mathbb Z$ there exists $n\in \mathbb Z$ such that no excluded minor for the class of $\mathbb F$-representable matroids has $n$ nested $k$-separations.
Interaction between skew-representability, tensor products, extension properties, and rank inequalities
ELTE Eötvös Loránd University（罗兰大学）；HUN-REN Alfréd Rényi Institute of Mathematics（匈牙利科学院阿尔弗雷德·雷尼数学研究所）；Universitat Politècnica de Catalunya（加泰罗尼亚理工大学）；London School of Economics and Political Science（伦敦政治经济学院）
While there are many parallels between matroid theory and $q$-matroid theory, most notably on the level of cryptomorphisms, there are substantial differences when it comes to the direct sum. The direct sum of $q$-matroids has been introduced in the literature only recently. In this short note we show that the direct sum of representable $q$-matroids may not be representable. It remains an open question whether representability of the direct sum can be characterized by the given $q$-matroids.
Let $M$ be a representable matroid on $n$ elements. We give bounds, in terms of $n$, on the least positive characteristic and smallest field over which $M$ is representable.
A fundamental theorem of matroid theory establishes that a transversal matroid is representable over fields of any characteristic. It was proved in 1970 by Piff and Welsh: their proof is elegant and concise and, moveover, constructive. However it is far from being algorithmic, in terms of suggesting a step-by-step procedure for deriving a collection of vectors over a given base field representing the transversal matroid induced by a given set system. In this note we recast Piff and Welsh's proof in algorithmic form.
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then prove that any graph is representable over all alphabets of size larger than some number depending on the graph. We also provide a characterisation of families representable over a given alphabet. Then, we associate a rank function and a rank operator to any representation which help us determine some criteria for the functions used in a representation. While li…
We extend the notion of matroid representations by matrices over fields and consider new representations of matroids by matrices over finite semirings, more precisely over the boolean and the superboolean semirings. This idea of representations is generalized naturally to include also hereditary collections. We show that a matroid that can be directly decomposed as matroids, each of which is representable over a field, has a boolean representation, and more generally that any arbitrary hereditary collection is superboolean-representable.
The correspondence between linear codes and representable matroids is well known. But a similar correspondence between quantum codes and matroids is not known. We show that representable symplectic matroids over a finite field $\mathbb{F}_q$ correspond to $\mathbb{F}_q$-linear quantum codes. Although this connection is straightforward, it does not appear to have been made earlier in literature. The correspondence is made through isotropic subspaces. We also show that the popular Calderbank-Shor-Steane (CSS) codes are essentially the homogenous symplectic matroids while the graph states, which …
We show how the set of Dyck paths of length 2n naturally gives rise to a matroid, which we call the "Catalan matroid" C_n. We describe this matroid in detail; among several other results, we show that C_n is self-dual, it is representable over the rationals but not over finite fields F_q with q < n-1, and it has a nice Tutte polynomial. We then generalize our construction to obtain a family of matroids, which we call "shifted matroids". They arose independently and almost simultaneously in the work of Klivans, who showed that they are precisely the matroids whose independence complex is a shif…
A Note on an Analytic Approach to the Problem of Finite Matroid Representability, The Cardinality of Sets of k-Independent Vectors over Finite Fields and the Maximum Distance Separable Conjecture
Department of Mathematics, FIZ Karlsruhe Leibnitz Institute for Information Infrastructure（FIZ Karlsruhe莱布尼茨信息基础设施研究所数学系）；Department of Economics, University of Toronto（多伦多大学经济系）
In this paper we give a necessary and sufficient criterion for representability of a matroid over an algebraic closed field. This leads to an algorithm, based on an extension of Groebner Bases, in order to decide if a given matroid is representable over such a field.
