English
Related papers

Related papers: On the complex-representable excluded minors for r…

200 papers

Fix a matroid N. A matroid M is N-fragile if, for each element e of M, at least one of M\e and M/e has no N-minor. The Bounded Canopy Conjecture is that all GF(q)-representable matroids M that have an N-minor and are N-fragile have branch…

Combinatorics · Mathematics 2011-08-02 Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

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

This paper defines a linear representation for nonlinear maps $F:\mathbb{F}^n\rightarrow\mathbb{F}^n$ where $\mathbb{F}$ is a finite field, in terms of matrices over $\mathbb{F}$. This linear representation of the map $F$ associates a…

Symbolic Computation · Computer Science 2024-04-04 Ramachandran Anantharaman , Virendra Sule

A representation field for a non-maximal order H in a central simple algebra A is a subfield of the spinor class field of maximal orders which determines the set of spinor genera of maximal orders representing H. In our previous work we…

Number Theory · Mathematics 2013-05-21 Luis Arenas-Carmona

For each positive integer $t$ and each sufficiently large integer $r$, we show that the maximum number of elements of a simple, rank-$r$, $\mathbb C$-representable matroid with no $U_{2,t+3}$-minor is $t{r\choose 2}+r$. We derive this as a…

Combinatorics · Mathematics 2025-02-13 Jim Geelen , Peter Nelson , Zach Walsh

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

A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…

Combinatorics · Mathematics 2013-03-01 R. A. Pendavingh , J. G. van der Pol

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…

Combinatorics · Mathematics 2019-09-09 Jim Geelen , Florian Hoersch

In this paper we determine the representation type of some algebras of infinite matrices continuously controlled at infinity by a compact metrizable space. We explicitly classify their finitely presented modules in the finite and tame…

Representation Theory · Mathematics 2007-05-23 Fernando Muro

The singleton and doubleton minors of a polymatroid $\rho$ encode a surprising amount of information about the structural complexity of $\rho$. Given any polymatroid $\rho$, we can subtract from it a maximally-separated polymatroid,…

Combinatorics · Mathematics 2023-12-01 Fiona Young

Let $M$ be an excluded minor for the class of $\mathbb{P}$-representable matroids for some partial field $\mathbb P$, and let $N$ be a $3$-connected strong $\mathbb{P}$-stabilizer that is non-binary. We prove that either $M$ is bounded…

Combinatorics · Mathematics 2021-02-04 Nick Brettell , Ben Clark , James Oxley , Charles Semple , Geoff Whittle

Let ${\bf A}={\bf A}_{n,m,k}$ be a random $n\times m$ matrix over $\mathbf{GF}_2$ wher each column consists of $k$ randomly chosen ones. Let $M$ be an arbirary fixed binary matroid. We show that if $m/n$ and $k$ are sufficiently large then…

Combinatorics · Mathematics 2019-03-13 Colin Cooper , Alan Frieze , Wesley Pegden

An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…

Combinatorics · Mathematics 2019-10-04 Matthias Lenz

We study maximal monotone operators $A : X \rightrightarrows X^*$ whose Fitzpatrick family reduces to a singleton; such operators will be called uniquely representable. We show that every such operator is cyclically monotone (hence,…

Functional Analysis · Mathematics 2025-10-13 Sotiris Armeniakos , Aris Daniilidis

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…

Combinatorics · Mathematics 2018-06-04 Ben Clark , James Oxley , Stefan H. M. van Zwam

We give a new proof, along with some generalizations, of a folklore theorem (attributed to Laurent Lafforgue) that a rigid matroid (i.e., a matroid with indecomposable basis polytope) has only finitely many projective equivalence classes of…

Combinatorics · Mathematics 2023-09-12 Matthew Baker , Oliver Lorscheid

In this paper we compute the minimum degree of a faithful representation by partial transformations of a finite semigroup admitting a faithful completely reducible matrix representation over the field of complex numbers. This includes all…

Group Theory · Mathematics 2023-06-12 Stuart Margolis , Benjamin Steinberg

If EE is a set of matroids, then ex(EE) denotes the set of matroids that have no minor isomorphic to a member of EE. If EE' is a subset of EE, we say that EE' is /superfluous/ if ex(EE - EE') - ex(EE) contains only finitely many 3-connected…

Combinatorics · Mathematics 2011-11-01 Rhiannon Hall , Dillon Mayhew , Stefan H. M. van Zwam

A group is called matricial field (MF) if it admits finite dimensional approximate unitary representations which are approximately faithful and approximately contained in the left regular representation. This paper provides a new class of…

Operator Algebras · Mathematics 2023-10-16 Christopher Schafhauser

Given a subgroup $\mathcal{H}$ of a product of finite groups $\mathcal{G} = \displaystyle\prod^n_{i=1} \Gamma_i$ and $b>1,$ we define a polymatroid $P(\mathcal{H},b).$ If all of the $\Gamma_i$ are isomorphic to $\mathbb{Z}/p\mathbb{Z},$ $p$…

Combinatorics · Mathematics 2024-02-28 Ed Swartz , Prairie Wentworth-Nice , Alexander Xue