English
Related papers

Related papers: Matroids with no $U_{2,n}$-minor and many hyperpla…

200 papers

For each integer $n \geq 2$, we prove that, if $M$ is a simple rank-$r$ $PG(n-1,2)$-free binary matroid with $|M|>\left(1-\frac{3}{2^n}\right)2^r$, then there is a triangle-free corank-$(n-2)$ flat of $M$.

Combinatorics · Mathematics 2016-05-24 Rutger Campbell

This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce $q$-polymatroids, the $q$-analogue of polymatroids, and develop their basic properties. We associate a pair of…

Information Theory · Computer Science 2019-09-06 Elisa Gorla , Relinde Jurrius , Hiram H. López , Alberto Ravagnani

We study smoothness of realization spaces of matroids for small rank and ground set. For $\mathbb{C}$-realizable matroids, when the rank is $3$, we prove that the realization spaces are all smooth when the ground set has $11$ or fewer…

Algebraic Geometry · Mathematics 2025-03-17 Daniel Corey , Dante Luber

From the configuration of a matroid (which records the size and rank of the cyclic flats and the containments among them, but not the sets), one can compute several much-studied matroid invariants, including the Tutte polynomial and a…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

The class of 2-regular matroids is a natural generalisation of regular and near-regular matroids. We prove an excluded-minor characterisation for the class of 2-regular matroids. The class of 3-regular matroids coincides with the class of…

Combinatorics · Mathematics 2023-09-07 Nick Brettell , James Oxley , Charles Semple , Geoff Whittle

Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…

Combinatorics · Mathematics 2015-01-30 Hiroyuki Miyata , Arnau Padrol

Let $T_n(q)$ be the ring of lower triangular matrices of order $n \geq 2$ with entries from the finite field $F(q)$ of order $q \geq 2$ and let ${^2T_n(q)}$ denote its free left module. For $n=2,3$ it is shown that the projective line over…

Rings and Algebras · Mathematics 2019-11-12 Edyta Bartnicka , Metod Saniga

We prove that the non-regular binary matroids with no $P_9^*$-minor have linear growth rate and the maximum size binary matroids with no $P_9^*$-minor are graphic. The main technique in the proof is the Strong Splitter Theorem using which…

Combinatorics · Mathematics 2014-12-30 S. R. Kingan

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

Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…

Combinatorics · Mathematics 2007-05-23 David G. Wagner

A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…

Combinatorics · Mathematics 2013-03-01 R. A. Pendavingh , J. G. van der Pol

We study a generalization of the concept of harmonic conjugation from projective geometry and full algebraic matroids to a larger class of matroids called \emph{harmonic matroids}. We use harmonic conjugation to construct a projective plane…

Combinatorics · Mathematics 2022-02-22 Rigoberto Florez

In this work we present an algorithm to construct sparse-paving matroids over finite set $S$. From this algorithm we derive some useful bounds on the cardinality of the set of circuits of any Sparse-Paving matroids which allow us to prove…

Combinatorics · Mathematics 2018-10-18 B. Mederos , M. Takane , G. Tapia-Sanchez , B. Zavala

Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. However, for each fixed finite field $\mathbb F$, the list…

Combinatorics · Mathematics 2025-08-15 Mamadou Mostapha Kanté , Eun Jung Kim , O-joung Kwon , Sang-il Oum

$q$-Matroids are defined on complemented modular support lattices. Minors of length 2 are of four types as in a "classical" matroid. Tutte polynomials $\tau(x,y)$ of matroids are calculated either by recursion over deletion/contraction of…

Combinatorics · Mathematics 2017-07-13 Guus Bollen , Henry Crapo , Relinde Jurrius

Our main result is the construction of symmetric Hadamard matrices of order q(1 + q) where q is a prime power congruent to 3 mod 8.

Combinatorics · Mathematics 2025-08-26 Dragomir Ž. Djoković

Let $q$ be an odd prime and $B = \{b_{j}\}_{j=1}^{l}$ be a finite set of nonzero integers that does not contain a perfect $q^{th}$ power. We show that $B$ has a $q^{th}$ power modulo every prime $p \neq q$ and not dividing $\prod_{b\in B}…

Number Theory · Mathematics 2023-06-19 Bhawesh Mishra

We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…

Combinatorics · Mathematics 2019-11-19 Alex Fink , Luca Moci

For a matroid $M$ of rank $r$ on $n$ elements, let $b(M)$ denote the fraction of bases of $M$ among the subsets of the ground set with cardinality $r$. We show that $$\Omega(1/n)\leq 1-b(M)\leq O(\log(n)^3/n)\text{ as }n\rightarrow \infty$$…

Combinatorics · Mathematics 2016-10-24 Rudi Pendavingh , Jorn van der Pol

In this article we make several contributions of independent interest. First, we introduce the notion of stressed hyperplane of a matroid, essentially a type of cyclic flat that permits to transition from a given matroid into another with…

Combinatorics · Mathematics 2022-11-16 Luis Ferroni , George D. Nasr , Lorenzo Vecchi
‹ Prev 1 3 4 5 6 7 10 Next ›