English
Related papers

Related papers: Mutations and (Non-)Euclideaness in oriented matro…

200 papers

Estimating the linear dimensionality of a data set in the presence of noise is a common problem. However, data may also be corrupted by monotone nonlinear distortion that preserves the ordering of matrix entries but causes linear methods…

Combinatorics · Mathematics 2024-01-01 Caitlin Lienkaemper

Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…

Computational Complexity · Computer Science 2019-06-20 Brahim Chaourar

Matroids over skew tracts provide an algebraic framework simultaneously generalizing the notions of linear subspaces, matroids, oriented matroids, phased matroids, and some other ``matroids with extra structure". A single-element extension…

Combinatorics · Mathematics 2025-12-24 Ting Su

For a positive integer $n\geq 3$, the sides and diagonals of a convex $n$-gon divide the interior of the convex $n$-gon into finitely (polynomial in $n$) many regions bounded by them. In this article, we associate to every region a unique…

Combinatorics · Mathematics 2021-04-13 C P Anil Kumar

We introduce the notion of Universally Decodable Matrices of Genus g (UDMG), which for g=0 reduces to the notion of Universally Decodable Matrices (UDM) introduced in [8]. A UDMG is a set of L matrices over a finite field, each with K rows,…

Information Theory · Computer Science 2013-01-28 Steve Limburg , David Grant , Mahesh K. Varanasi

The {\em Dressian} of a matroid $M$ is the set of all valuations of $M$. This Dressian is the support of a polyhedral complex $\mathcal{Dr}(M)$ whose open cells correspond 1-1 with matroid subdivisions of the matroid polytope of $M$. We…

Combinatorics · Mathematics 2024-08-20 Rudi Pendavingh

In this paper, we give a formula for the number of lattice points in the dilations of Schubert matroid polytopes. As applications, we obtain the Ehrhart polynomials of uniform and minimal matroids as special cases, and give a recursive…

Combinatorics · Mathematics 2022-12-07 Neil J. Y. Fan , Yao Li

In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor isomorphic to: U2,5; U3,5; the Fano plane and its dual; the non-Fano and its dual; the single-element deletion of AG(2,3), its dual, and the…

Combinatorics · Mathematics 2009-07-12 Rhiannon Hall , Dillon Mayhew , Stefan H. M. van Zwam

In 1977 Stanley proved that the $h$-vector of a matroid is an $\mathcal{O}$-sequence and conjectured that it is a pure $\mathcal{O}$-sequence. In the subsequent years the validity of this conjecture has been shown for a variety of classes…

Combinatorics · Mathematics 2017-06-20 Aaron Dall

The $OS$ algebra $A$ of a matroid $M$ is a graded algebra related to the Whitney homology of the lattice of flats of $M$. In case $M$ is the underlying matroid of a hyperplane arrangement \A in $\C^r$, $A$ is isomorphic to the cohomology…

Combinatorics · Mathematics 2007-05-23 Carrie Eschenbrenner , Michael Falk

We generalize Baker-Bowler's theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets, and orthogonal vector sets, and…

Combinatorics · Mathematics 2025-08-13 Tong Jin , Donggyu Kim

Let F : P^n --> P^n be a morphism of degree d > 1 defined over C. The dynamical Mordell--Lang conjecture says that the intersection of an orbit O_F(P) and a subvariety X of P^n is usually finite. We consider the number of linear…

Number Theory · Mathematics 2011-09-02 Joseph H. Silverman , Bianca Viray

Extending the notion of geometric bijections for regular matroids, introduced by the first and third author with Matthew Baker, we describe a family of bijections between bases of an oriented matroid and special orientations. These…

Combinatorics · Mathematics 2026-04-07 Spencer Backman , Francisco Santos , Chi Ho Yuen

Klaus showed that the Oriented Matroid Complementarity Problem (OMCP) can be solved by a reduction to the problem of sink-finding in a unique sink orientation (USO) if the input is promised to be given by a non-degenerate extension of a…

Combinatorics · Mathematics 2024-07-29 Michaela Borzechowski , Simon Weber

Motivated by the characterization of the lattice of cyclic flats of a matroid, the convolution of a ranked lattice and a discrete measure is defined, generalizing polymatroid convolution. Using the convolution technique we prove that if a…

Combinatorics · Mathematics 2019-10-03 Laszlo Csirmaz

It was conjectured, twenty years ago, the following result that would generalize the so-called rank rigidity theorem for homogeneous Euclidean submanifolds: let M^n, n>=2, be a full and irreducible homogeneous submanifold of the sphere…

Differential Geometry · Mathematics 2013-06-11 Carlos Olmos , Richar Fernando Riaño-Riaño

It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that $s(n) \sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In…

Combinatorics · Mathematics 2016-01-26 Rudi Pendavingh , Jorn van der Pol

In this paper we study the number of $k$-neighborly reorientations of an oriented matroid, leading to study $k$-Roudneff's conjecture, the case $k=1$ being the original statement conjectured in 1991. We first prove the conjecture for the…

Combinatorics · Mathematics 2025-12-02 Rangel Hernández , Luis Pedro Montejano

A structure M is pregeometric if the algebraic closure is a pregeometry in all M' elementarily equivalent to M. We define a generalisation: structures with an existential matroid. The main examples are superstable groups of U-rank a power…

Logic · Mathematics 2011-04-12 Antongiulio Fornasiero

We call a class $\mathcal{M}$ of matroids hereditary if it is closed under flats. We denote by $\mathcal{M}^{ext}$ the class of matroids $M$ that is in $\mathcal{M}$, or has an element $e$ such that $M \backslash e$ is in $\mathcal{M}$. We…

Combinatorics · Mathematics 2024-11-21 Jagdeep Singh , Vaidy Sivaraman