English
Related papers

Related papers: Finite matchability under the matroidal Hall's con…

200 papers

For (potentially infinite) matroids $ M $ and $ N $, an $ (M,N) $-hindrance is a set $ H$ that is independent but not spanning in $ N.\mathsf{span}_M(H) $. This concept was introduced by Aharoni and Ziv in the very first paper investigating…

Combinatorics · Mathematics 2025-02-27 Attila Joó

Finite matroids are combinatorial structures that express the concept of linear independence. In 1964, G.-C. Rota conjectured that the coefficients of the "characteristic polynomial" of a matroid $M$, polynomial whose coefficients enumerate…

Algebraic Geometry · Mathematics 2023-03-03 Antoine Chambert-Loir

Let $\mathcal{M}$ and $\mathcal{N}$ be two matroids on the same ground set $V$. Let $A_1,\dots,A_{2n-1}$ be sets which are independent in both $\mathcal{M}$ and $\mathcal{N}$, satisfying $|A_i|\geq \textrm{min}(i,n)$ for all $i$. We show…

Combinatorics · Mathematics 2025-11-06 Eli Berger , Daniel McGinnis

We obtain an explicit analytical sufficient condition on $E$ that ensures the monotonicity of the matrix $M+E$, where $M$ is an $M$-matrix.

Combinatorics · Mathematics 2013-08-06 Felix Goldberg

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ó

Let ${\mathcal{M} = (M_i \colon i\in K)}$ be a finite or infinite family consisting of matroids on a common ground set $E$ each of which may be finitary or cofinitary. We prove the following Cantor-Bernstein-type result: If there is a…

Combinatorics · Mathematics 2024-05-27 Joshua Erde , Pascal Gollin , Attila Joó , Paul Knappe , Max Pitz

We present a strengthening of the countable Menger theorem (edge version) of R. Aharoni. Let $ D=(V,A) $ be a countable digraph with $ s\neq t\in V $ and let $\mathcal{M}=\bigoplus_{v\in V}\mathcal{M}_v $ be a matroid on $ A $ where $…

Combinatorics · Mathematics 2017-05-02 Attila Joó

Given an arbitrary field K and non-zero scalars a and b, we give necessary and sufficient conditions for a matrix A in M_n(K) to be a linear combination of two idempotents with coefficients a and b. This extends results previously obtained…

Rings and Algebras · Mathematics 2010-05-14 Clément de Seguins Pazzis

We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices when all agents have path-independent choice functions. This result answers an open question of Blair~\cite{blair1988lattice}. In the…

Discrete Mathematics · Computer Science 2026-04-09 Christopher En , Yuri Faenza

We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group $(G,+)$ is a bijection $f:A\to B$ between two finite subsets $A,B$ of $G$ satisfying $a+f(a)\notin A$ for all $a\in A$. A…

Combinatorics · Mathematics 2024-02-15 Mohsen Aliabadi , Shira Zerbib

A matroid is sticky if any two of its extensions by disjoint sets can be glued together along the common restriction (that is, they have an amalgam). The sticky matroid conjecture asserts that a matroid is sticky if and only if it is…

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

The Greene-Magnanti theorem states that if $ M $ is a finite matroid, $ B_0 $ and $ B_1 $ are bases and $ B_0=\bigcup_{i=1}^{n} X_i $ is a partition, then there is a partition $ B_1=\bigcup_{i=1}^{n}Y_i $ such that $ (B_0 \setminus X_i)…

Combinatorics · Mathematics 2022-04-21 Zsuzsanna Jankó , Attila Joó

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

Let $M$ be a matroid and let $Q$, $R$, $S$ and $T$ be subsets of the ground set such that the smallest separation that separates $Q$ from $R$ has order $k$ and the smallest separation that separates $S$ from $T$ has order $l$. We prove that…

Combinatorics · Mathematics 2014-03-06 Rong Chen , Geoff Whittle

It is proven that the "horizon condition", which was found to characterize the fundamental modular region in continuum theory and the thermodynamic limit of gauge theory on a periodic lattice, holds for every (transverse) configuration on a…

High Energy Physics - Theory · Physics 2007-05-23 M. Schaden , D. Zwanziger

We give a new proof of the fact that the complement of the complexification of a real hyperplane arrangement is homotopy equivalent to the Salvetti complex of the associated oriented matroid. Our proof involves no choices, is relatively…

Combinatorics · Mathematics 2025-07-10 Galen Dorpalen-Barry , Dan Dugger , Nicholas Proudfoot

Let $M$ be a 3-connected matroid, and let $N$ be a 3-connected minor of $M$. A pair $\{x_1,x_2\} \subseteq E(M)$ is $N$-detachable if one of the matroids $M/x_1/x_2$ or $M \backslash x_1 \backslash x_2$ is both 3-connected and has an…

Combinatorics · Mathematics 2022-01-04 Nick Brettell , Geoff Whittle , Alan Williams

Necessary and sufficient conditions are given on matrices $A$, $B$ and $S$, having entries in some field $\mathbb F$ and suitable dimensions, such that the linear span of the terms $A^iSB^j$ over $\mathbb F$ is equal to the whole matrix…

Rings and Algebras · Mathematics 2019-02-13 Giacomo Micheli , Joachim Rosenthal , Paolo Vettori

For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…

Combinatorics · Mathematics 2015-01-06 Jim Geelen , Bert Gerards , Geoff Whittle

The exact matching condition is given for hadron matrix elements calculated in any two different schemes, in particular, in the lattice and dimensional regularization, (modified) minimal subtraction $\overline{\rm MS}$ schemes. The result…

High Energy Physics - Lattice · Physics 2007-05-23 Xiangdong Ji
‹ Prev 1 2 3 10 Next ›