English
Related papers

Related papers: Proof of Nash-Williams' Intersection Conjecture fo…

200 papers

Gordon introduced a class of matroids $M(n)$, for prime $n\ge 2$, such that $M(n)$ is algebraically representable, but only in characteristic $n$. Lindstr\"om proved that $M(n)$ for general $n\ge 2$ is not algebraically representable if…

Combinatorics · Mathematics 2022-02-22 Rigoberto Florez

The disproved Nash Williams conjecture states that every 4-regular 4-connected graph has a hamiltonian cycle. We show that a modification of this conjecture is equivalent to the Dominating Cycle Conjecture.

Combinatorics · Mathematics 2015-08-12 Arthur Hoffmann-Ostenhof

The connected components of $\mathcal{M}_{0,n}(\mathbb{R})$ are in bijection with the $(n-1)!/2$ dihedral orderings of $[n]$. They are all isomorphic. We construct monomial maps between them, and use these maps to prove a conjecture of…

Combinatorics · Mathematics 2025-09-05 Veronica Calvo Cortes , Hannah Tillmann-Morris

Richter-Gebert proved that every non-Euclidean uniform oriented matroid admits a biquadratic final polynomial. We extend this result to the non-uniform case.

Combinatorics · Mathematics 2007-05-23 Komei Fukuda , Sonoko Moriyama , Hiroki Nakayama

We show that if a countable structure $M$ in a finite relational language is not cellular, then there is an age-preserving $N \supseteq M$ such that $2^{\aleph_0}$ many structures are bi-embeddable with $N$. The proof proceeds by a case…

Logic · Mathematics 2022-09-14 Samuel Braunfeld , Michael C. Laskowski

Given two matroids $\mathcal{M}_1$ and $\mathcal{M}_2$ over the same ground set, the matroid intersection problem is to find the maximum cardinality common independent set. In the weighted version of the problem, the goal is to find a…

Data Structures and Algorithms · Computer Science 2026-02-18 Aditi Dudeja , Mara Grilnberger

A matroid of rank $r$ on $n$ elements is a positroid if it has a representation by an $r$ by $n$ matrix over $\mathbb{R}$, each $r$ by $r$ submatrix of which has nonnegative determinant. Earlier characterizations of connected positroids and…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

We prove that for every compact, connected, differentiable 3--manifold $M$ there is a compact complex manifold $X$ which can be obtained from projective 3--space by a sequence of smooth, real blow ups and downs such that $M$ is…

Algebraic Geometry · Mathematics 2016-09-07 János Kollár

We study the multiplicity number of the characteristic cycle of the intersection complex of the matroid Schubert variety. It is shown to be a combinatorial invariant, and it can be computed by explicit formulas. We also conjecture that the…

Algebraic Geometry · Mathematics 2025-01-14 Yiyu Wang

The McCarty Conjecture states that any McCarty Matrix (an $n\times n$ matrix $A$ with positive integer entries and each of the $2n$ row and column sums equal to $n$), can be additively decomposed into two other matrices, $B$ and $C$, such…

Combinatorics · Mathematics 2025-05-08 Anant Godbole , Lybitina Koene , Grant Shirley

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

We show that Nash-Williams' theorem asserting that the countable transfinite sequences of elements of a better-quasi-ordering ordered by embeddability form a better-quasi-ordering is provable in the subsystem of second order arithmetic…

Logic · Mathematics 2009-09-25 Alberto Marcone

For any matroid $M$, we compute the Tutte polynomial $T_M(x,y)$ using the mixed intersection numbers of certain classes in the combinatorial Chow ring $A^\bullet(M)$ arising from hypersimplices. Using the mixed Hodge-Riemann relations, we…

Algebraic Geometry · Mathematics 2023-03-27 Andrew Berget , Hunter Spink , Dennis Tseng

In this paper we consider the classic matroid intersection problem: given two matroids $\M_{1}=(V,\I_{1})$ and $\M_{2}=(V,\I_{2})$ defined over a common ground set $V$, compute a set $S\in\I_{1}\cap\I_{2}$ of largest possible cardinality,…

Data Structures and Algorithms · Computer Science 2019-11-26 Deeparnab Chakrabarty , Yin Tat Lee , Aaron Sidford , Sahil Singla , Sam Chiu-wai Wong

In this paper, we prove the Shafarevich conjecture for certain complete intersections of hypersurfaces in abelian varieties defined over a number field $K$ using the Lawrence-Venkatesh method. The main new inputs we need are computation of…

Number Theory · Mathematics 2025-06-19 Frank Lu

We prove a theorem on equivariant maps implying the following two corollaries: (1) Let N and M be compact orientable n-manifolds with boundaries such that M\subset N, the inclusion M\to N induces an isomorphism in integral cohomology, both…

Geometric Topology · Mathematics 2012-07-06 D. Goncalves , A. Skopenkov

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

Can the real line with removed zero be covered by countably many linearly (algebraically) independent subsets over the field of rationals? We use a matroid approach to show that an answer is "Yes" under the Continuum Hypothesis, and "No"…

Combinatorics · Mathematics 2011-08-23 Taras Banakh , Igor Protasov

Given a matroid $M=(E,{\cal I})$, and a total ordering over the elements $E$, a broken circuit is a circuit where the smallest element is removed and an NBC independent set is an independent set in ${\cal I}$ with no broken circuit. The set…

Computational Complexity · Computer Science 2023-05-08 Dorna Abdolazimi , Kasper Lindberg , Shayan Oveis Gharan

Let $M$ be a 3-connected binary matroid and let $Y(M)$ be the set of elements of $M$ avoiding at least $r(M)+1$ non-separating cocircuits of $M$. Lemos proved that $M$ is non-graphic if and only if $Y(M)\neq\emp$. We generalize this result…

Combinatorics · Mathematics 2012-11-27 João Paulo Costalonga
‹ Prev 1 3 4 5 6 7 10 Next ›