English
Related papers

Related papers: Matroids with a modular 4-point line

200 papers

The cycles of a graph give a natural cyclic ordering to their edge-sets, and these orderings are consistent in that two edges are adjacent in one cycle if and only if they are adjacent in every cycle in which they appear together. An…

Combinatorics · Mathematics 2023-04-11 Cameron Crenshaw , James Oxley

We prove da Silva's 1987 conjecture that any positively oriented matroid is a positroid; that is, it can be realized by a set of vectors in a real vector space. It follows from this result and a result of the third author that the positive…

Combinatorics · Mathematics 2013-11-05 Federico Ardila , Felipe Rincón , Lauren Williams

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

Given a simple Eulerian binary matroid $M$, what is the minimum number of disjoint circuits necessary to decompose $M$? We prove that $|M| / (\operatorname{rank}(M) + 1)$ many circuits suffice if $M = \mathbb F_2^n \setminus \{0\}$ is the…

Combinatorics · Mathematics 2023-07-18 Bryce Frederickson , Lukas Michel

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Combinatorics · Mathematics 2018-12-13 Matthew Baker , Nathan Bowler

Generalizing a theorem of the first two authors and Geelen for planes, we show that, for a real-representable matroid $M$, either the average hyperplane-size in $M$ is at most a constant depending only on its rank, or each hyperplane of $M$…

Combinatorics · Mathematics 2025-09-03 Rutger Campbell , Matthew E. Kroeker , Ben Lund

We construct oriented matroids of rank 3 on 13 points whose realization spaces are disconnected. They are defined on smaller points than the known examples with this property. Moreover, we construct the one on 13 points whose realization…

Combinatorics · Mathematics 2012-01-13 Yasuyuki Tsukamoto

A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…

Combinatorics · Mathematics 2019-09-11 Austin Alderete

A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…

Combinatorics · Mathematics 2021-06-16 Rigoberto Flórez , Thomas Zaslavsky

We construct a class of 3-point constants in the $sl(4)$ Toda conformal theory $W_4$, extending the examples in Fateev and Litvinov. Their knowledge allows to determine the braiding/fusing matrix transforming 4-point conformal blocks of one…

High Energy Physics - Theory · Physics 2016-01-27 P. Furlan , V. B. Petkova

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

We discuss the moduli space of flat connections of Yang-Mills theories formulated on T^3 x R, with periodic boundary conditions. When the gauge group is SO(N>=7), G_2, F_4, E_6, E_7 or E_8, the moduli space consists of more than one…

High Energy Physics - Theory · Physics 2007-05-23 Arjan Keurentjes

The isotropic matroid $M[IAS(G)]$ of a looped simple graph $G$ is a binary matroid equivalent to the isotropic system of $G$. In general, $M[IAS(G)]$ is not regular, so it cannot be represented over fields of characteristic $\neq 2$. The…

Combinatorics · Mathematics 2020-02-06 Robert Brijder , Lorenzo Traldi

A phased matroid is a matroid with additional structure which plays the same role for complex vector arrangements that oriented matroids play for real vector arrangements. The realization space of an oriented (resp., phased) matroid is the…

Combinatorics · Mathematics 2018-07-20 Amanda Ruiz

A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…

Combinatorics · Mathematics 2022-03-16 Gianira N. Alfarano , Karan Khathuria , Simran Tinani

We study the evolution of random matroids represented by the sequence of random matrices over ${\mathbb F}_q$ where columns are added one after the other, and each column vector is a uniformly random vector in ${\mathbb F}_q^n$, independent…

Combinatorics · Mathematics 2024-04-29 Pu Gao , Jacob Mausberg , Peter Nelson

We construct, for every $r \ge 3$ and every prime power $q > 10$, a rank-$r$ matroid with no $U_{2,q+2}$-minor, having more hyperplanes than the rank-$r$ projective geometry over $\mathrm{GF}(q)$.

Combinatorics · Mathematics 2018-05-21 Adam Brown , Peter Nelson

We prove a conjecture of Geelen, Gerards, and Whittle that for any finite field $GF(q)$ and any integer $t$, every cosimple $GF(q)$-representable matroid with sufficiently large girth contains either $M(K_t)$ or $M(K_t)^*$ as a minor.

Combinatorics · Mathematics 2025-05-01 James Davies , Meike Hatzel , Kolja Knauer , Rose McCarty , Torsten Ueckerdt

We initiate the axiomatic study of affine oriented matroids (AOMs) on arbitrary ground sets, obtaining fundamental notions such as minors, reorientations and a natural embedding into the frame work of Complexes of Oriented Matroids. The…

Combinatorics · Mathematics 2024-04-09 Emanuele Delucchi , Kolja Knauer

We show that the infinite matroid intersection conjecture of Nash-Williams implies the infinite Menger theorem proved recently by Aharoni and Berger. We prove that this conjecture is true whenever one matroid is nearly finitary and the…

Combinatorics · Mathematics 2012-07-10 Elad Aigner-Horev , Johannes Carmesin , Jan-Oliver Fröhlich