English
Related papers

Related papers: Characterizing real-representable matroids with la…

200 papers

A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…

Combinatorics · Mathematics 2016-09-07 Christos A. Athanasiadis

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

One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…

Combinatorics · Mathematics 2017-01-31 June Huh , Botong Wang

We show that, if $M$ is a simple rank-$n$ matroid with no $\ell$-point line minor and no minor isomorphic to the cycle matroid of a $t$-vertex complete graph, then the ratio $|M| / n$ is bounded above by a singly exponential function of…

Combinatorics · Mathematics 2023-06-28 Peter Nelson , Sergey Norin , Fernanda Rivera Omana

We show that the coefficients of the characteristic polynomial of a central hyperplane arrangement $\mathcal A$, coincide with the multidegrees of the Gauss map of a pencil of hypersurfaces naturally associated to $\mathcal A$. As a…

Algebraic Geometry · Mathematics 2025-06-05 Thiago Fassarella , Nivaldo Medeiros

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

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

Combinatorics · Mathematics 2020-04-24 Aaron Lin , Konrad Swanepoel

A classic problem in matroid theory is to find subspace arrangements, specifically hyperplane and pseudosphere arrangements, whose intersection posets are isomorphic to a prescribed geometric lattice. Engstr\"om recently showed how to…

Combinatorics · Mathematics 2019-09-04 Steven Klee , Matthew T. Stamps

Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…

Data Structures and Algorithms · Computer Science 2017-10-09 Fedor V. Fomin , Petr A. Golovach , Daniel Lokshtanov , Saket Saurabh

Based on the notion of vectors and linear subspaces for a matroid, we develop a theory of flats and hyperplane arrangements for T-matroids, where T is a tract. This leads to several cryptomorphic descriptions of T-matroids: in terms of its…

Combinatorics · Mathematics 2026-03-11 Jannis Koulman , Oliver Lorscheid

We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…

Combinatorics · Mathematics 2012-09-10 Jim Geelen , Peter Nelson

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Combinatorics · Mathematics 2015-03-20 Ben Green , Terence Tao

The Sylvester-Gallai Theorem states that every rank-$3$ real-representable matroid has a two-point line. We prove that, for each $k\ge 2$, every complex-representable matroid with rank at least $4^{k-1}$ has a rank-$k$ flat with exactly $k$…

Combinatorics · Mathematics 2024-04-30 Jim Geelen , Matthew E. Kroeker

We show that, if $\alpha > 0$ is a real number, $n \ge 2$ and $\ell \ge 2$ are integers, and $q$ is a prime power, then every simple matroid $M$ of sufficiently large rank, with no $U_{2,\ell}$-minor, no rank-$n$ projective geometry minor…

Combinatorics · Mathematics 2012-10-17 Jim Geelen , Peter Nelson

We construct, for every $r \ge 3$ and every prime power $q > 10$, a rank-$r$ matroid with no $U_{2,q+2}$-minor, having more hyperplanes than the rank-$r$ projective geometry over $\mathrm{GF}(q)$.

Combinatorics · Mathematics 2018-05-21 Adam Brown , Peter Nelson

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…

Combinatorics · Mathematics 2015-12-21 Nima Amini , Petter Brändén

We present a new direct proof of a topological representation theorem for oriented matroids in the general rank case. Our proof is based on an earlier rank 3 version. It uses hyperline sequences and the generalized Sch{\"o}nflies theorem.…

Combinatorics · Mathematics 2007-05-23 Juergen Bokowski , Simon King , Susanne Mock , Ileana Streinu

In this article we extend the notion of determinantal representation of hypersurfaces to the determinantal representation of sections of the determinant line bundle of a vector bundle. We give several examples, and prove some necessary…

Algebraic Geometry · Mathematics 2026-02-19 A. El Mazouni , D. S. Nagaraj , Supravat Sarkar

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…

Combinatorics · Mathematics 2011-09-07 Peter J. Cameron , Maximilien Gadouleau , Søren Riis

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