English
Related papers

Related papers: On Rota's Conjecture and nested separations in mat…

200 papers

Komj\'ath, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit…

Combinatorics · Mathematics 2025-09-17 Nathan Bowler , Attila Joó

We prove that if $ M $ and $ N $ are finitary matroids on a common countable edge set $ E $ then they admit a common independent set $I $ such that there is a bipartition $ E=E_{M}\cup E_{N} $ for which $ I\cap E_M $ spans $ E_M $ in $ M $…

Combinatorics · Mathematics 2021-04-06 Attila Joó

A 1965 result of Crapo shows that every elementary lift of a matroid $M$ can be constructed from a linear class of circuits of $M$. In a recent paper, Walsh generalized this construction by defining a rank-$k$ lift of a matroid $M$ given a…

Combinatorics · Mathematics 2025-02-19 Daniel Irving Bernstein , Zach Walsh

We show that, if $k$ and $\ell$ are positive integers and $r$ is sufficiently large, then the number of rank-$k$ flats in a rank-$r$ matroid $M$ with no $U_{2,\ell+2}$-minor is less than or equal to number of rank-$k$ flats in a rank-$r$…

Combinatorics · Mathematics 2013-09-18 Peter Nelson

The proper Class $\bf{No}$ of all Conway's numbers $\cite{l3}$ is considered as a region of investigation. It turns out to be a total ordered Field (i.e., a field whose domain is a proper Class) and this totally, or linear ordered Class,…

Logic · Mathematics 2024-06-19 Ju. T. Lisica

The separation theorem of Kirchberger can be proven using a combination of Farkas' Lemma and Caratheodory's Theorem. Since those theorems are at the heart of oriented matroids, we are interested in a generalization of Kirchberger's Theorem…

Combinatorics · Mathematics 2022-07-29 Winfried Hochstättler , Sophia Keip , Kolja Knauer

Let $K$ be a totally real number field of degree $n \geq 2$. The inverse different of $K$ gives rise to a lattice in $\mathbb{R}^n$. We prove that the space of Schwartz Fourier eigenfunctions on $\mathbb{R}^n$ which vanish on the…

Number Theory · Mathematics 2022-06-09 Danylo Radchenko , Martin Stoller

We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…

Combinatorics · Mathematics 2024-05-31 Matthew Kwan , Ashwin Sah , Mehtaab Sawhney

A conjecture of Odoni stated over Hilbertian fields $K$ of characteristic zero asserts that for every positive integer $d$, there exists a polynomial $f\in K[x]$ of degree $d$ such that for every positive integer $n$, each iterate $f^{\circ…

Number Theory · Mathematics 2023-05-11 Sushma Palimar

One characterization of binary matroids is that the symmetric difference of every pair of intersecting circuits is a disjoint union of circuits. This paper considers circuit-difference matroids, that is, those matroids in which the…

Combinatorics · Mathematics 2020-08-11 George Drummond , Tara Fife , Kevin Grace , James Oxley

A matroid is uniform if and only if it has no minor isomorphic to $U_{1,1}\oplus U_{0,1}$ and is paving if and only if it has no minor isomorphic to $U_{2,2}\oplus U_{0,1}$. This paper considers, more generally, when a matroid $M$ has no…

Combinatorics · Mathematics 2021-02-24 George Drummond

We prove that for every proper minor-closed class $M$ of matroids representable over a prime field, there exists a constant-competitive matroid secretary algorithm for the matroids in $M$. This result relies on the extremely powerful…

Combinatorics · Mathematics 2019-10-03 Tony Huynh , Peter Nelson

Let K be a field, let R=K[x_1,..., x_m] be a polynomial ring with the standard Z^m-grading (multigrading), let L be a Noetherian multigraded R-module, and let F: E --> G be a finite free multigraded presentation of L over R. Given a choice…

Commutative Algebra · Mathematics 2007-05-23 Alexandre Tchernev

Rota's Basis Conjecture is a well known problem from matroid theory, that states that for any collection of $n$ bases in a rank $n$ matroid, it is possible to decompose all the elements into $n$ disjoint rainbow bases. Here an asymptotic…

Combinatorics · Mathematics 2020-08-14 Alexey Pokrovskiy

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

We consider a finite-dimensional vector space $W\subset K^E$ over an arbitrary field $K$ and an arbitrary set $E$. We show that the set $C(W)\subset 2^E$ consisting of the minimal supports of $W$ are the circuits of a matroid on $E$. In…

Mayhew and Royle (2008) showed that there are 564 excluded minors for the class of GF(5)-representable matroids having at most 9 elements. We enumerate the excluded minors for GF(5)-representable matroids having 10 elements: there are…

Combinatorics · Mathematics 2025-04-17 Nick Brettell

We conjecture that the class of frame matroids can be characterised by a sentence in the monadic second-order logic of matroids, and we prove that there is such a characterisation for the class of bicircular matroids. The proof does not…

Combinatorics · Mathematics 2021-03-02 Daryl Funk , Dillon Mayhew , Mike Newman

We study the existence and the number of $k$-neighborly reorientations of an oriented matroid. This leads to $k$-variants of McMullen's problem and Roudneff's conjecture, the case $k=1$ being the original statements on complete cells in…

Combinatorics · Mathematics 2024-02-06 Rangel Hernández-Ortiz , Kolja Knauer , Luis Pedro Montejano

If S is a set of matroids, then the matroid M is S-fragile if, for every element e in E(M), either M\e or M/e has no minor isomorphic to a member of S. Excluded-minor characterizations often depend, implicitly or explicitly, on…

Combinatorics · Mathematics 2015-05-01 Carolyn Chun , Deborah Chun , Dillon Mayhew , Stefan H. M. van Zwam