English
Related papers

Related papers: A Tverberg type theorem for matroids

200 papers

As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset…

Combinatorics · Mathematics 2011-09-06 Naoki Katoh , Shin-ichi Tanigawa

Morphisms of matroids are combinatorial abstractions of linear maps and graph homomorphisms. We introduce the notion of basis for morphisms of matroids, and show that its generating function is strongly log-concave. As a consequence, we…

Combinatorics · Mathematics 2020-04-02 Christopher Eur , June Huh

We introduce a new ``Winding Number Conjecture'' about maps from the $(d-1)$-skeleton of the $((d+1)(q-1))$-simplex into $\real^d$. This conjecture is equivalent to the Topological Tverberg Theorem. Furthermore, many statements about the…

Combinatorics · Mathematics 2007-05-23 Torsten Schöneborn

Let $M$ be an internally $4$-connected binary matroid with every element in three triangles. Then $M$ has at least four elements $e$ such that si$(M/e)$ is internally 4-connected.

Combinatorics · Mathematics 2016-08-23 Carolyn Chun , James Oxley

Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…

Algebraic Geometry · Mathematics 2024-04-12 Daniel Bath , Uli Walther

In $1980$ White conjectured that every element of the toric ideal of a matroid is generated by quadratic binomials corresponding to symmetric exchanges. We prove White's conjecture for high degrees with respect to the rank. This extends our…

Combinatorics · Mathematics 2021-12-01 Michał Lasoń

For each odd integer $k\ge 5$, we prove that, if $M$ is a simple rank-$r$ binary matroid with no odd circuit of length less than $k$ and with $|M| > k 2^{r-k+1}$, then $M$ is isomorphic to a restriction of the rank-$r$ binary affine…

Combinatorics · Mathematics 2014-02-25 Jim Geelen

Two orthonormal bases B and B' of a d-dimensional complex inner-product space are called mutually unbiased if and only if |<b|b'>|^2=1/d holds for all b in B and b' in B'. The size of any set containing (pairwise) mutually unbiased bases of…

Quantum Physics · Physics 2023-11-27 Andreas Klappenecker , Martin Roetteler

The unextendible entangled basis with any arbitrarily given Schmidt number $k$ (UEBk) in $\mathbb{C}^{d_1}\otimes\mathbb{C}^{d_2}$ is proposed in [Phys. Rev. A 90 (2014) 054303], $1<k\leq \min\{d_1,d_2\}$, which is a set of orthonormal…

Quantum Physics · Physics 2015-09-08 Yu Guo , Yanping Jia , Xiulan Li

The "topological Tverberg conjecture" by B\'ar\'any, Shlosman and Sz\H{u}cs (1981) states that any continuous map of a simplex of dimension $(r-1)(d+1)$ to $\mathbb{R}^d$ maps points from $r$ disjoint faces of the simplex to the same point…

Combinatorics · Mathematics 2020-06-02 Florian Frick

For all positive integers $t$ exceeding one, a matroid has the cyclic $(t-1,t)$-property if its ground set has a cyclic ordering $\sigma$ such that every set of $t-1$ consecutive elements in $\sigma$ is contained in a $t$-element circuit…

Combinatorics · Mathematics 2021-08-27 Nick Brettell , Deborah Chun , Tara Fife , Charles Semple

For a symmetric 2t-cycle in the tope graph of a simple oriented matroid M on the ground set {1,...,t}, where t is even, we describe decompositions of topes and subtopes of M with respect to the subtopes corresponding to the edges of the…

Combinatorics · Mathematics 2021-06-17 Andrey O. Matveev

In this work, we study matroids over a domain and several classical combinatorial and algebraic invariants related. We define their Grothendieck-Tutte polynomial $T_{\mathcal{M}}(x,y)$, extending the definition given by Fink and Moci in…

Combinatorics · Mathematics 2019-09-04 Alessio Borzì , Ivan Martino

In this paper we investigate the Ehrhart Theory of the independence matroid polytope of uniform matroids. It is proved that these polytopes have an Ehrhart polynomial with positive coefficients. To do that, we prove that indeed all…

Combinatorics · Mathematics 2021-05-24 Luis Ferroni

A transversal matroid whose dual is also transversal is called bi-transversal. Let $G$ be an undirected graph with vertex set $V$. In this paper, for every subset $W$ of $V$, we associate a bi-transversal matroid to the pair $(G,W)$. We…

Combinatorics · Mathematics 2024-03-01 Mahdi Ebrahimi

The Sylvester-Gallai Theorem states that every rank-$3$ real-representable matroid has a two-point line. We prove that, for each $k\ge 2$, every complex-representable matroid with rank at least $4^{k-1}$ has a rank-$k$ flat with exactly $k$…

Combinatorics · Mathematics 2024-04-30 Jim Geelen , Matthew E. Kroeker

Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…

Data Structures and Algorithms · Computer Science 2017-10-09 Fedor V. Fomin , Petr A. Golovach , Daniel Lokshtanov , Saket Saurabh

Consider a matroid where all elements are labeled with an element in $\mathbb{Z}$. We are interested in finding a base where the sum of the labels is congruent to $g \pmod m$. We show that this problem can be solved in $\tilde{O}(2^{4m} n…

Combinatorics · Mathematics 2024-03-22 Siyue Liu , Chao Xu

Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…

Combinatorics · Mathematics 2025-12-05 Emiliano Liwski , Fatemeh Mohammadi , Rémi Prébet

It is known that there exist hyperplane arrangements with same underlying matroid that admit non-homotopy equivalent complement manifolds. In this work we show that, in any rank, complex central hyperplane arrangements with up to 7…

Combinatorics · Mathematics 2017-01-31 Matteo Gallet , Elia Saini
‹ Prev 1 3 4 5 6 7 10 Next ›