English
Related papers

Related papers: Positively oriented matroids are realizable

200 papers

Recently, it was proved by Anari-Oveis Gharan-Vinzant, Anari-Liu-Oveis Gharan-Vinzant and Br\"{a}nd\'{e}n-Huh that, for any matroid $M$, its basis generating polynomial and its independent set generating polynomial are log-concave on the…

Combinatorics · Mathematics 2020-03-24 Satoshi Murai , Takahiro Nagaoka , Akiko Yazawa

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

We give two graph theoretical characterizations of tope graphs of (complexes of) oriented matroids. The first is in terms of excluded partial cube minors, the second is that all antipodal subgraphs are gated. A direct consequence is a third…

Combinatorics · Mathematics 2019-05-29 Kolja Knauer , Tilen Marc

Let $M$ be a matroid. We study the expansions of $M$ mainly to see how the combinatorial properties of $M$ and its expansions are related to each other. It is shown that $M$ is a graphic, binary or a transversal matroid if and only if an…

Combinatorics · Mathematics 2017-05-29 Rahim Rahmati-Asghar

A projective rectangle is like a projective plane that has different lengths in two directions. We develop harmonic conjugation in projective rectangles. We construct projective rectangles in some harmonic matroids (matroids where harmonic…

Combinatorics · Mathematics 2024-07-17 Rigoberto Florez , Thomas Zaslavsky

Matroid theory is often thought of as a generalization of graph theory. In this paper we propose an analogous correspondence between embedded graphs and delta-matroids. We show that delta-matroids arise as the natural extension of graphic…

Combinatorics · Mathematics 2019-03-04 Carolyn Chun , Iain Moffatt , Steven D. Noble , Ralf Rueckriemen

Cotransversal matroids are a family of matroids that arise from planted graphs. We prove that two planted graphs give the same cotransversal matroid if and only if they can be obtained from each other by a series of local moves.

Combinatorics · Mathematics 2010-02-21 Federico Ardila , Amanda Ruiz

If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the…

Combinatorics · Mathematics 2013-09-04 Robert Brijder , Hendrik Jan Hoogeboom , Lorenzo Traldi

This is the third paper in a series on oriented matroids and Grassmannians. We construct a $(\mathrm{O}_3\times\mathbb{Z}_2)$-equivariant strong deformation retraction from the homeomorphism group of the 2-sphere to $\mathrm{O}_3$, where…

Geometric Topology · Mathematics 2021-08-05 Michael Gene Dobbins

Inspired by Kontsevich's graphic orbifold Euler characteristic we define a virtual Euler characteristic for any finite set of isomorphism classes of matroids of rank $r$. Our main result provides a simple formula for the virtual Euler…

Combinatorics · Mathematics 2026-02-05 Madeline Brandt , Juliette Bruce , Daniel Corey

In contrast to matroids, vf-safe delta-matroids have three kinds of minors and are closed under the operations of twist and loop complementation. We show that the delta-matroids representable over GF(4) with respect to the nontrivial…

Combinatorics · Mathematics 2014-05-16 Robert Brijder , Hendrik Jan Hoogeboom

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

We show for each positive integer $a$ that, if $\mathcal{M}$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $c$ such that either every rank-$r$ matroid in $\mathcal{M}$ can…

Combinatorics · Mathematics 2013-06-04 Peter Nelson

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

Combinatorics · Mathematics 2016-07-04 Ben Elias , Nicholas Proudfoot , Max Wakefield

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

We introduce the self-projecting Grassmannian, an irreducible subvariety of the Grassmannian parametrizing linear subspaces that satisfy a generalized self-duality condition. We study its relation to classical moduli spaces, such as the…

Algebraic Geometry · Mathematics 2025-11-27 Alheydis Geiger , Francesca Zaffalon

In this note we consider the following conjecture: given any closed symplectic manifold $M$, there is a sufficiently small real positive number $\rho$ such that the open ball of radius $\rho$ in the Hofer metric centered at the identity on…

Symplectic Geometry · Mathematics 2014-04-22 François Lalonde , Yakov Savelyev

Let $M$ be a representable matroid on $n$ elements. We give bounds, in terms of $n$, on the least positive characteristic and smallest field over which $M$ is representable.

Combinatorics · Mathematics 2019-10-28 Jason Bell , Daryl Funk , Byoung Du Kim , Dillon Mayhew

Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given…

Combinatorics · Mathematics 2014-07-29 Simeon Ball , Carles Padró , Zsuzsa Weiner , Chaoping Xing

Describing minimal generating set of a toric ideal is a well-studied and difficult problem. In 1980 White conjectured that the toric ideal associated to a matroid is equal to the ideal generated by quadratic binomials corresponding to…

Combinatorics · Mathematics 2014-04-01 Michał Lasoń , Mateusz Michałek
‹ Prev 1 4 5 6 7 8 10 Next ›