English
Related papers

Related papers: The smallest matroids with no large independent fl…

200 papers

For each proper minor-closed subclass $\cM$ of the $\GF(q^2)$-representable matroids containing all simple $\GF(q)$-representable matroids, we give, for all large $r$, a tight upper bound on the number of points in a rank-$r$ matroid in…

Combinatorics · Mathematics 2011-05-23 Peter Nelson

For matroids M and N on disjoint sets S and T, a semidirect sum of M and N is a matroid K on the union of S and T that, like the direct sum and the free product, has the restriction of K to S equal to M and the contraction of K to T equal…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Joseph P. S. Kung

A classification is given for (regular) positions of direct sums of two matroid algebras (unital algebraic limits of matrix algebras) in a matroid superalgebra, where the individual summands have index 2 in their associated corner algebra.…

Operator Algebras · Mathematics 2007-05-23 S. C. Power

We consider the rank reduction problem for matroids: Given a matroid M and an integer k, find a minimum size subset of elements of M whose removal reduces the rank of M by at least k. When M is a graphical matroid this problem is the…

Data Structures and Algorithms · Computer Science 2021-12-23 Gwenaël Joret , Adrian Vetta

We prove that asymptotically almost all matroids have a trivial automorphism group, or an automorphism group generated by a single transposition. Additionally, we show that asymptotically almost all sparse paving matroids have a trivial…

Combinatorics · Mathematics 2016-09-19 Rudi Pendavingh , Jorn van der Pol

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 an integer $d \ge 2$, what is the least $r$ so that there is a set of binary quadratic forms $\{f_1,\dots,f_r\}$ for which $\{f_j^d\}$ is non-trivially linearly dependent? We show that if $r \le 4$, then $d \le 5$, and for $d \ge 4$,…

Number Theory · Mathematics 2020-01-08 Bruce Reznick

A positroid is a special case of a realizable matroid that arose from the study of the totally nonnegative part of the Grassmannian by Postnikov. In this paper, we study the facets of its matroid polytope and the independent set polytope.…

Combinatorics · Mathematics 2021-08-17 Suho Oh , David Xiang

Motivated by Kontsevich's graph complexes, this paper gives a systematic study of matroid complexes. We construct deletion and contraction bicomplexes on the vector space spanned by matroid classes equipped with ground-set orientations,…

Combinatorics · Mathematics 2026-05-26 Juliette Bruce , Jacob Bucciarelli , Bailee Zacovic

A new connection between two different necessary conditions for a polymatroid to be linearly representable is presented. Specifically, we prove that the existence of a tensor product with the uniform matroid of rank two on three elements…

Combinatorics · Mathematics 2025-02-20 Carles Padró

The cogirth, $g^\ast(M)$, of a matroid $M$ is the size of a smallest cocircuit of $M$. Finding the cogirth of a graphic matroid can be done in polynomial time, but Vardy showed in 1997 that it is NP-hard to find the cogirth of a binary…

Combinatorics · Mathematics 2021-06-03 Cameron Crenshaw , James Oxley

We prove that the 18-element non-lattice orthomodular poset depicted in the paper is the smallest one and unique up to isomorphism. Since not every Boolean poset is orthomodular, we consider the class of the so-called generalized…

Quantum Algebra · Mathematics 2022-10-12 Ivan Chajda , Miroslav Kolařík , Helmut Länger

We give two proofs that the $h$-vector of any paving matroid is a pure O-sequence, thus answering in the affirmative a conjecture made by R. Stanley, for this particular class of matroids. We also investigate the problem of obtaining good…

Combinatorics · Mathematics 2010-08-17 Criel Merino , Steven D. Noble , Marcelino Ramírez-Ibañez , Rafael Villarroel

Let M and N be internally 4-connected binary matroids such that M has a proper N-minor, and |E(N)| is at least seven. As part of our project to develop a splitter theorem for internally 4-connected binary matroids, we prove the following…

Combinatorics · Mathematics 2012-06-22 Carolyn Chun , Dillon Mayhew , James Oxley

Nested matroids were introduced by Crapo in 1965 and have appeared frequently in the literature since then. A flat of a matroid $M$ is Hamiltonian if it has a spanning circuit. A matroid $M$ is nested if and only if its Hamiltonian flats…

Combinatorics · Mathematics 2018-01-23 Tara Fife , James Oxley

Stanley conjectured in 1977 that the $h$-vector of a matroid simplicial complex is a pure $O$-sequence. We give simple constructive proofs that the conjecture is true for matroids of rank less than or equal to 3, and corank 2. We used…

Combinatorics · Mathematics 2011-06-15 Jesus DeLoera , Yvonne Kemper , Steven Klee

A tope committee K* for a simple oriented matroid M is a subset of its maximal covectors such that every positive halfspace of M contains more than half of the covectors from K*. The structures of the family of all committees for M, and of…

Combinatorics · Mathematics 2008-11-30 Andrey O. Matveev

Adding elements to matroids can be fraught with difficulty. In the V\'amos matroid $V_8$, there are four independent sets $X_1,X_2, X_3,$ and $X_4$ such that $(X_1 \cup X_2,X_3 \cup X_4)$ is a $3$-separation while exactly three of the local…

Combinatorics · Mathematics 2018-05-15 James Oxley

Let $T$ be a staircase rank-one construction with parameters $r_j \sim j^d$, $0<d<0.2$, then its spectrum does not have the group property, and the symmetric tensor product $T\odot T$ has simple spectrum.

Dynamical Systems · Mathematics 2024-07-04 Valery V. Ryzhikov

This paper is devoted to the study of independent spaces of q-polymatroids. With the aid of an auxiliary q-matroid it is shown that the collection of independent spaces satisfies the same properties as for q-matroids. However, in contrast…

Combinatorics · Mathematics 2021-05-06 Heide Gluesing-Luerssen , Benjamin Jany
‹ Prev 1 8 9 10 Next ›