English
Related papers

Related papers: Projective geometries in exponentially dense matro…

200 papers

Seymour's Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that…

Combinatorics · Mathematics 2015-03-13 Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

We show that for an odd prime r > 3 and an integer g > 1, in the projective representation given by the SO(3) Witten-Chern-Simons theory at an rth root of unity, the image of the mapping class group of a surface of genus g is dense.

Geometric Topology · Mathematics 2009-11-10 Michael Larsen , Zhenghan Wang

We prove a conjecture of Geelen, Gerards, and Whittle that for any finite field $GF(q)$ and any integer $t$, every cosimple $GF(q)$-representable matroid with sufficiently large girth contains either $M(K_t)$ or $M(K_t)^*$ as a minor.

Combinatorics · Mathematics 2025-05-01 James Davies , Meike Hatzel , Kolja Knauer , Rose McCarty , Torsten Ueckerdt

Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived matroid $\delta M$ that has as its ground set $\mathcal{C}(M)$. Unlike previous attempts of such a definition, our definition applies to…

Combinatorics · Mathematics 2022-12-22 Olga Kuznetsova , Ragnar Freij-Hollanti , Relinde Jurrius

We prove, by means of an exact structural description, that every simple triangle-free binary matroid $M$ with $|M| > \tfrac{33}{128}2^{r(M)}$ has critical number at most $2$.

Combinatorics · Mathematics 2015-09-09 Rutger Campbell , Jim Geelen , Peter Nelson

We show that for every subset $E$ of positive density in the set of integer square-matrices with zero traces, there exists an integer $k \geq 1$ such that the set of characteristic polynomials of matrices in $E-E$ contains the set of…

Dynamical Systems · Mathematics 2017-05-17 Michael Björklund , Alexander Fish

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…

Algebraic Geometry · Mathematics 2014-09-12 Eric Katz

Given an integer mxn matrix A satisfying certain regularity assumptions, we consider the set F(A) of all integer vectors b such that the associated knapsack polytope P(A,b)={x: Ax=b, x>=0} contains an integer point. When m=1 the set F(A) is…

Optimization and Control · Mathematics 2009-11-24 Iskander Aliev , Martin Henk

It is proved that every separable $C^*$-algebra of real rank zero contains an AF-sub-$C^*$-algebra such that the inclusion mapping induces an isomorphism of the ideal lattices of the two $C^*$-algebras and such that every projection in a…

Operator Algebras · Mathematics 2007-05-23 Francesc Perera , Mikael Rordam

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

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

The Las Vergnas' strong map conjecture, states that any strong map of oriented matroids $f:\mathcal{M}_1\rightarrow\mathcal{M}_2$ can be factored into extensions and contractions. The conjecture is known to be false due to a construction by…

Combinatorics · Mathematics 2019-04-23 Pei Wu

Let $F$ be an infinite field and let $f$ be a nonzero multilinear polynomial with coefficients in $F$. We prove that for every positive integer $d$ there exists a positive integer $s$ such that $f(M_{s}(F))$, the image of $f$ in $M_{s}(F)$,…

Rings and Algebras · Mathematics 2024-12-13 Daniel Vitas

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

Let M to be a matroid defined on a finite set E. A subset L of E is locked in M if L is 2-connected in M, the complement of L is 2-connected in the dual M*, and min{r(L), r*(complement of L)} is greater than 1. In this paper, we prove that…

Combinatorics · Mathematics 2016-12-22 Brahim Chaourar

We prove an explicit upper bound on the number of real quadratic fields that admit a universal quadratic form of a given rank, thus establishing a density zero statement. More generally, we obtain such a result for totally positive definite…

Number Theory · Mathematics 2025-05-23 Vitezslav Kala , Pavlo Yatsyna , Błażej Żmija

Let $M$ be a matroid. We study the expansions of $M$ mainly to see how the combinatorial properties of $M$ and its expansions are related to each other. It is shown that $M$ is a graphic, binary or a transversal matroid if and only if an…

Combinatorics · Mathematics 2017-05-29 Rahim Rahmati-Asghar

In this note, we consider matrices similar to $X$-form matrices, which are the matrices for which only the diagonal and the anti-diagonal elements can be different from zero. First, we give a characterization of these matrices using the…

Rings and Algebras · Mathematics 2023-08-31 Flavien Mabilat

For a given finitely generated multiplicative subgroup of the rationals which possibly contain negative numbers, we derive, subject to GRH, formulas for the densities of primes for which the index of the reduction group has a given value.…

Number Theory · Mathematics 2020-06-04 Herish Abdullah , Andam Ali Mustafa , Francesco Pappalardi

We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…

Statistics Theory · Mathematics 2019-09-24 Daniel Irving Bernstein , Grigoriy Blekherman , Rainer Sinn
‹ Prev 1 3 4 5 6 7 10 Next ›