English
Related papers

Related papers: Certifying Non-representability of Matroids Over P…

200 papers

We show that, for any prime $p$ and integer $k \geq 2$, a simple GF($p$)-representable matroid with sufficiently high rank has a rank-$k$ flat which is either independent in $M$, or is a projective or affine geometry. As a corollary we…

Combinatorics · Mathematics 2023-09-28 Jim Geelen , Matthew E. Kroeker

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…

Combinatorics · Mathematics 2015-03-31 Jim Geelen , Rohan Kapadia

It is proved that for each prime field $GF(p)$, there is an integer $f(p)$ such that a 4-connected matroid has at most $f(p)$ inequivalent representations over $GF(p)$. We also prove a stronger theorem that obtains the same conclusion for…

Combinatorics · Mathematics 2011-01-26 Jim Geelen , Geoff Whittle

Let $r \leqslant n$ be nonnegative integers, and let $N = \binom{n}{r} - 1$. For a matroid $M$ of rank $r$ on the finite set $E = [n]$ and a partial field $k$ in the sense of Semple--Whittle, it is known that the following are equivalent:…

Combinatorics · Mathematics 2024-01-02 Matthew Baker , Tong Jin

For an integer $n>2$, a rank-$n$ matroid is called an $n$-spike if it consists of $n$ three-point lines through a common point such that, for all $k\in\{1, 2, ..., n - 1\}$, the union of every set of $k$ of these lines has rank $k+1$.…

Combinatorics · Mathematics 2007-05-23 Zhaoyang Wu , Zhi-Wei Sun

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…

Combinatorics · Mathematics 2007-05-23 Massimiliano Lunelli , Antonio Laface

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,…

Combinatorics · Mathematics 2011-01-14 R. A. Pendavingh , S. H. M. van Zwam

We prove that, as $n$ approaches infinity, the proportion of $n$-element matroids that are representable tends to zero.

Combinatorics · Mathematics 2018-01-31 Peter Nelson

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…

Combinatorics · Mathematics 2015-09-16 S. R. Kingan

Matroid theory is fundamentally connected with index coding and network coding problems. In fact, the reliance of linear index coding and network coding rates on the characteristic of a field has been demonstrated by using the two…

Information Theory · Computer Science 2024-07-18 Arman Sharififar , Parastoo Sadeghi , Neda Aboutorab

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,…

Combinatorics · Mathematics 2013-04-25 Jim Geelen , Rohan Kapadia

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.

Combinatorics · Mathematics 2019-10-28 Jason Bell , Daryl Funk , Byoung Du Kim , Dillon Mayhew

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\"om proved that $M(n)$ for general $n\ge 2$ is not algebraically representable if…

Combinatorics · Mathematics 2022-02-22 Rigoberto Florez

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…

Combinatorics · Mathematics 2014-01-29 Peter Nelson , Stefan H. M. van Zwam

A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…

Computational Complexity · Computer Science 2024-08-21 Eun Jung Kim , Arnaud de Mesmay , Tillmann Miltzow

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…

Combinatorics · Mathematics 2014-07-29 Simeon Ball , Carles Padró , Zsuzsa Weiner , Chaoping Xing

A $q$-matroid is the analogue of a matroid which arises by replacing the finite ground set of a matroid with a finite-dimensional vector space over a finite field. These $q$-matroids are motivated by coding theory as the representable…

Combinatorics · Mathematics 2025-11-27 Sebastian Degen , Lukas Kühne

We prove that there is no polynomial $p(\cdot)$ with the property that a matroid $M$ can be determined to be either a lifted-graphic or frame matroid using at most $p(|M|)$ rank evaluations. This resolves two conjectures of Geelen, Gerards…

Combinatorics · Mathematics 2016-01-11 Rong Chen , Geoff Whittle

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…

Combinatorics · Mathematics 2021-11-10 Peter Nelson , Zach Walsh

We introduce various quantities that can be defined for an arbitrary matroid, and show that certain conditions on these quantities imply that a matroid is not representable over $\mathbb{F}_q$ where $q$ is a prime power. Mostly, for a…

Combinatorics · Mathematics 2023-06-01 J. Sun , S. B. Damelin
‹ Prev 1 2 3 10 Next ›