English
Related papers

Related papers: Matroid multiple cyclic exchange property

200 papers

Cyclic flats form a common structural invariant of both matroids and $q$-matroids, determining these objects through their weighted lattices of cyclic flats. In this paper we exploit this perspective to establish a correspondence between…

Combinatorics · Mathematics 2026-03-17 Andrew Fulcher

This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…

Combinatorics · Mathematics 2013-12-16 Franz J. Király , Zvi Rosen , Louis Theran

We show that, under suitable hypotheses, the foundation of a generalized parallel connection of matroids is the relative tensor product of the foundations. Using this result, we show that the foundation of a 2-sum of matroids is the…

Combinatorics · Mathematics 2025-05-16 Matthew Baker , Oliver Lorscheid , Zach Walsh , Tianyi Zhang

We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…

Combinatorics · Mathematics 2025-12-04 Lazar Guterman , Eran Nevo

In this paper we introduce discrete polymatroids satisfying the one-sided strong exchange property and show that they are sortable (as a consequence their base rings are Koszul) and that they satisfy White's conjecture. Since any pruned…

Commutative Algebra · Mathematics 2017-03-09 Dancheng Lu

We show that the change of basis matrices of a set of $m$ bases of a finite vector space is a connected groupoid of order $m^2$. We define a general method to express the elements of change of basis matrices as algebraic expressions using…

Rings and Algebras · Mathematics 2021-07-13 D. A. Wolfram

A matroid M is cyclically orderable if there is a cyclic permutation of the elements of M such that any r consecutive elements form a basis in M. An old conjecture of Kajitani, Miyano, and Ueno states that a matroid M is cyclically…

Combinatorics · Mathematics 2024-08-06 Sean McGuinness

For a simplicial complex ${\mathcal C}$ denote by $\beta({\mathcal C})$ the minimal number of edges from ${\mathcal C}$ needed to cover the ground set. If ${\mathcal C}$ is a matroid then for every partition $A_1, \ldots, A_m$ of the ground…

Combinatorics · Mathematics 2017-01-06 Ron Aharoni , Eli Berger , Dani Kotlar , Ran Ziv

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ó

It has been conjectured that the toric ideal of the base ring of a discrete polymatroid is generated by symmetric exchange binomials. In the present paper, we give several classes of discrete polymatroids which yield toric ideals generated…

Commutative Algebra · Mathematics 2025-07-17 Takayuki Hibi , Seyed Amin Seyed Fakhari

We show that given a finitely generated standard-graded algebra of dimension $d$ over an infinite field, its graded Noether normalizations obey a certain kind of `generic exchange', allowing one to pass between any two of them in at most…

Commutative Algebra · Mathematics 2011-07-07 Joseph P. Brennan , Neil Epstein

We prove that, if $B_1, \dots, B_n$ are disjoint bases of a rank-$n$ matroid, then there are at least $\lfloor{\frac{n}{6 \lceil{\log n}\rceil}}\rfloor$ disjoint transversals of $(B_1, \dots, B_n)$ that are also bases.

Combinatorics · Mathematics 2018-02-06 Sally Dong , Jim Geelen

In recent years, combinatorial reconfiguration problems have attracted great attention due to their connection to various topics such as optimization, counting, enumeration, or sampling. One of the most intriguing open questions concerns…

Combinatorics · Mathematics 2023-11-14 Kristóf Bérczi , Bence Mátravölgyi , Tamás Schwarcz

We study the connection between multimatroids and moduli spaces of rational curves with cyclic action. Multimatroids are generalizations of matroids and delta-matroids introduced by Bouchet, which naturally arise in topological graph…

Combinatorics · Mathematics 2024-03-01 Emily Clader , Chiara Damiolini , Christopher Eur , Daoji Huang , Shiyue Li

A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…

Combinatorics · Mathematics 2025-11-19 Jonah Berggren , Jeremy L. Martin , José A. Samper

We prove a general result concerning cyclic orderings of the elements of a matroid. For each matroid $M$, weight function $\omega:E(M)\rightarrow\mathbb{N}$, and positive integer $D$, the following are equivalent. (1) For all $A\subseteq…

Combinatorics · Mathematics 2011-07-20 Jan van den Heuvel , Stéphan Thomassé

As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and…

Combinatorics · Mathematics 2012-03-06 Nathan Bowler , Johannes Carmesin

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, and oriented matroids. We call the resulting objects matroids over hyperfields. In fact, there are (at least)…

Combinatorics · Mathematics 2017-04-21 Matthew Baker , Nathan Bowler

Versions of Bailey's lemma which change the base from q to q^2 or q^3 are given. Iterates of these versions give many new versions of multisum Rogers-Ramanujan identities. We also prove Melzer's conjectures for the Fermionic forms of the…

Combinatorics · Mathematics 2007-05-23 David Bressoud , Mourad Ismail , Dennis Stanton

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