English
Related papers

Related papers: The joints problem for matroids

200 papers

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

Combinatorics · Mathematics 2013-06-04 Peter Nelson

We show that for any finite generic union of pairs $(x_i,L_i)_i$ where $x_i\in L_i$ is a point of the line $L_i$ in projective $n$-space, the divisors $m_ix_i$ on the $L_i$ have maximal rank with respect to homogeneous $d$ forms for all…

alg-geom · Mathematics 2008-02-03 J. Alexander , A. Hirschowitz

We provide a formula for the Ehrhart polynomial of the connected matroid of size $n$ and rank $k$ with the least number of bases, also known as a minimal matroid. We prove that their polytopes are Ehrhart positive and $h^*$-real-rooted (and…

Combinatorics · Mathematics 2021-06-17 Luis Ferroni

We prove that the Tutte polynomial of a coloopless paving matroid is convex along the portions of the line segments x+y=p lying in the positive quadrant. Every coloopless paving matroids is in the class of matroids which contain two…

Combinatorics · Mathematics 2010-04-16 L. E. Chavez-Lomelí , C. Merino , S. D. Noble , M. Ramírez-Ibañez

It is known that $N(n)$, the maximum number of mutually orthogonal latin squares of order $n$, satisfies the lower bound $N(n) \ge n^{1/14.8}$ for large $n$. For $h\ge 2$, relatively little is known about the quantity $N(h^n)$, which…

Combinatorics · Mathematics 2020-08-21 Michael Bailey , Coen del valle , Peter J. Dukes

We define a monodromy homomorphism for irreducible families of regular elliptic fibrations which takes values in the mapping class group of a punctured sphere. We compute the monodromy for elliptic fibrations only which contain no singular…

Algebraic Geometry · Mathematics 2007-05-23 Michael Lönne

We compute conjugacy classes in maximal parabolic subgroups of the general linear group. This computation proceeds by reducing to a ``matrix problem''. Such problems involve finding normal forms for matrices under a specified set of row and…

Group Theory · Mathematics 2007-05-23 Scott H. Murray

For a matroid $M$ of rank $r$ on $n$ elements, let $b(M)$ denote the fraction of bases of $M$ among the subsets of the ground set with cardinality $r$. We show that $$\Omega(1/n)\leq 1-b(M)\leq O(\log(n)^3/n)\text{ as }n\rightarrow \infty$$…

Combinatorics · Mathematics 2016-10-24 Rudi Pendavingh , Jorn van der Pol

Inspired by a recent result of Brakensiek et al. that symmetric tensor matroids and rigidity matroids are linked by matroid duality, we define abstract symmetric tensor matroids as a dual concept to abstract rigidity matroids and establish…

Combinatorics · Mathematics 2025-03-20 Bill Jackson , Shin-ichi Tanigawa

A matching is compatible to two or more labeled point sets of size $n$ with labels $\{1,\dots,n\}$ if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to…

Computational Geometry · Computer Science 2022-09-07 Oswin Aichholzer , Alan Arroyo , Zuzana Masárová , Irene Parada , Daniel Perz , Alexander Pilz , Josef Tkadlec , Birgit Vogtenhuber

We prove the joints conjecture, showing that for any $N$ lines in ${\Bbb R}^3$, there are at most $O(N^{{3 \over 2}})$ points at which 3 lines intersect non-coplanarly. We also prove a conjecture of Bourgain showing that given $N^2$ lines…

Combinatorics · Mathematics 2008-12-08 Larry Guth , Nets Hawk Katz

Consider a subset [1,2,...,n]x[1,2,...,n] of the plane integer lattice. Take any non self-intersecting n^2-gon built on it (straight angles are allowed). The square of a side length is a positive integer. It is thus natural to ask how large…

Combinatorics · Mathematics 2024-05-21 Oliver Mantas Ališauskas , Giedrius Alkauskas , Valdas Dičiūnas

Given two matroids $\mathcal{M}_1$ and $\mathcal{M}_2$ over the same $n$-element ground set, the matroid intersection problem is to find a largest common independent set, whose size we denote by $r$. We present a simple and generic auction…

Data Structures and Algorithms · Computer Science 2024-10-22 Joakim Blikstad , Ta-Wei Tu

The {\em breadth} of a tangle $\mathcal{T}$ in a matroid is the size of the largest spanning uniform submatroid of the tangle matroid of $\mathcal{T}$. A matroid $M$ is {\em weakly $4$-connected} if it is 3-connected and whenever $(X,Y)$ is…

Combinatorics · Mathematics 2025-04-17 Nick Brettell , Susan Jowett , James Oxley , Charles Semple , Geoff Whittle

We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…

Commutative Algebra · Mathematics 2012-12-17 Alexandru Constantinescu , Matteo Varbaro

We prove that the number of single element extensions of $M(K_{n+1})$ is $2^{{n\choose n/2}(1+o(1))}$. This is done using a characterization of extensions as "linear subclasses".

Combinatorics · Mathematics 2021-11-15 Peter Nelson , Shayla Redlin , Jorn van der Pol

In this paper, we give a formula for the number of lattice points in the dilations of Schubert matroid polytopes. As applications, we obtain the Ehrhart polynomials of uniform and minimal matroids as special cases, and give a recursive…

Combinatorics · Mathematics 2022-12-07 Neil J. Y. Fan , Yao Li

Let R be a family of n axis-parallel rectangles with packing number p-1, meaning that among any p of the rectangles, there are two with a non-empty intersection. We show that the union complexity of R is at most O(n+p^2), and that the…

Combinatorics · Mathematics 2017-02-06 Chaya Keller , Shakhar Smorodinsky

Let $K$ be a number field and ${\mathcal O}$ be the ring of $S$-integers in $K$. Morgan, Rapinchuck, and Sury have proved that if the group of units ${\mathcal O}^{\times}$ is infinite, then every matrix in ${\rm SL}_2({\mathcal O})$ is a…

Number Theory · Mathematics 2022-06-08 Bruce W. Jordan , Yevgeny Zaytman

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
‹ Prev 1 3 4 5 6 7 10 Next ›