English
Related papers

Related papers: Stability, fragility, and Rota's Conjecture

200 papers

The Fan-Raspaud Conjecture states that every bridgeless cubic graph has three 1-factors with empty intersection. A weaker one than this conjecture is that every bridgeless cubic graph has two 1-factors and one join with empty intersection.…

Combinatorics · Mathematics 2016-01-22 Ligang Jin , Giuseppe Mazzuoccolo , Eckhard Steffen

A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…

Combinatorics · Mathematics 2025-06-30 Rebecca Monks , Anthony Nixon

Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…

Combinatorics · Mathematics 2026-04-27 Sean Dewar , Georg Grasegger , Anthony Nixon , Zvi Rosen , William Sims , Meera Sitharam , David Urizar

Consider a matroid $M$ whose ground set is equipped with a labeling to an abelian group. A basis of $M$ is called $F$-avoiding if the sum of the labels of its elements is not in a forbidden label set $F$. H\"orsch, Imolay, Mizutani, Oki,…

Combinatorics · Mathematics 2024-11-12 Dániel Garamvölgyi , Ryuhei Mizutani , Taihei Oki , Tamás Schwarcz , Yutaro Yamaguchi

Let R be any ring (with 1), \Gamma a group and R\Gamma the corresponding group ring. Let H be a subgroup of \Gamma of finite index. Let M be an R\Gamma -module, whose restriction to RH is projective. Moore's conjecture: Assume for every…

Group Theory · Mathematics 2007-05-23 Eli Aljadeff

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

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

Combinatorics · Mathematics 2015-06-08 Elad Aigner-Horev , Reinhard Diestel , Luke Postle

Frame matroids and lifted-graphic matroids are two distinct minor-closed classes of matroids, each of which generalises the class of graphic matroids. The class of quasi-graphic matroids, recently introduced by Geelen, Gerards, and Whittle,…

Combinatorics · Mathematics 2017-06-21 Daryl Funk , Dillon Mayhew

Let G be a connected reductive group defined over a non-archimedean local field of characteristic 0. We assume G is quasi-split, adjoint and absolutly simple. Let g be the Lie algebra of G. We consider the space of the invariant…

Representation Theory · Mathematics 2025-09-15 Jean-Loup Waldspurger

We study the evolution of random matroids represented by the sequence of random matrices over ${\mathbb F}_q$ where columns are added one after the other, and each column vector is a uniformly random vector in ${\mathbb F}_q^n$, independent…

Combinatorics · Mathematics 2024-04-29 Pu Gao , Jacob Mausberg , Peter Nelson

Rado's Conjecture is a compactness/reflection principle that says any nonspecial tree of height $\omega_1$ has a nonspecial subtree of size $\leq \aleph_1$. Though incompatible with Martin's Axiom, Rado's Conjecture turns out to have many…

Logic · Mathematics 2019-06-18 Jing Zhang

We give degree lower bounds for quotient line bundles of the lowest piece of a Hodge module induced by a complex variation of Hodge structures outside a simple normal crossing divisor, beyond the unipotent variation case. This note aims to…

Algebraic Geometry · Mathematics 2026-05-14 Ze Yun

A $q$-matroid is the analogue of a matroid which arises by replacing the finite ground set of a matroid with a finite-dimensional vector space over a finite field. These $q$-matroids are motivated by coding theory as the representable…

Combinatorics · Mathematics 2025-11-27 Sebastian Degen , Lukas Kühne

If $M$ is a matroid, then a simple matroid $M'$ with the same rank as $M$ is an adjoint of $M$ if there is an inclusion-reversing embedding $\phi$ of the lattice of flats of $M$ into the lattice of flats of $M'$ such that $\phi$ maps the…

Combinatorics · Mathematics 2025-02-25 Kevin Grace

The Torsion Anomalous Conjecture states that an irreducible variety $V$ embedded in a semi-abelian variety contains only finitely many maximal $V$-torsion anomalous varieties. In this paper we consider an irreducible variety embedded in a…

Number Theory · Mathematics 2024-04-09 Sara Checcoli , Francesco Veneziano , Evelina Viada

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

For $M$ $\omega$-categorical and stable, we investigate the growth rate of $M$, i.e. the number of orbits of $Aut(M)$ on $n$-sets, or equivalently the number of $n$-substructures of $M$ after performing quantifier elimination. We show that…

Logic · Mathematics 2022-02-25 Samuel Braunfeld

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

Let F_q be a finite field of order q with characteristic p. An arc is an ordered family of at least k vectors in (F_q)^k in which every subfamily of size k is a basis of (F_q)^k. The MDS conjecture, which was posed by Segre in 1955, states…

Combinatorics · Mathematics 2016-11-08 Ameera Chowdhury

We prove that for every poset $P$, there is a constant $C$ such that the size of any family of subsets of $[n]$ that does not contain $P$ as an induced subposet is at most $C{\binom{n}{\lfloor\frac{n}{2}\rfloor}}$, settling a conjecture of…

Combinatorics · Mathematics 2014-09-11 Abhishek Methuku , Dömötör Pálvölgyi