中文
相关论文

相关论文: Minors of asymptotically almost all sparse paving …

200 篇论文

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…

组合数学 · 数学 2016-09-19 Rudi Pendavingh , Jorn van der Pol

The Mayhew--Newman--Welsh--Whittle conjecture predicts that asymptotically almost all matroids are sparse paving. We study the gap between paving and sparse paving matroids at the logarithmic scale. Let \(p_n\) be the number of paving…

组合数学 · 数学 2026-05-13 Mohsen Aliabadi

We prove that every paving matroid that is an excluded minor of interval positroids can be reduced to one of three fundamental families of excluded minors of interval positroids by relaxing dependent hyperplanes. Using this result, we…

组合数学 · 数学 2023-12-07 Hyungju Park

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…

组合数学 · 数学 2016-01-26 Rudi Pendavingh , Jorn van der Pol

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…

组合数学 · 数学 2013-03-01 R. A. Pendavingh , J. G. van der Pol

If $M$ is a matroid, then a simple matroid $M'$ with the same rank as $M$ is an adjoint of $M$ if there is an inclusion-reversing embedding $\phi$ of the lattice of flats of $M$ into the lattice of flats of $M'$ such that $\phi$ maps the…

组合数学 · 数学 2025-02-25 Kevin Grace

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…

组合数学 · 数学 2018-10-18 B. Mederos , M. Takane , G. Tapia-Sanchez , B. Zavala

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…

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$$…

组合数学 · 数学 2016-10-24 Rudi Pendavingh , Jorn van der Pol

Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…

组合数学 · 数学 2024-01-22 Pu Gao , Peter Nelson

For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…

组合数学 · 数学 2015-01-06 Jim Geelen , Bert Gerards , Geoff Whittle

It has been conjectured that sparse paving matroids will eventually predominate in any asymptotic enumeration of matroids, i.e. that $\lim_{n\rightarrow\infty} s_n/m_n = 1$, where $m_n$ denotes the number of matroids on $n$ elements, and…

组合数学 · 数学 2014-12-11 Rudi Pendavingh , Jorn van der Pol

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

组合数学 · 数学 2016-04-18 Jim Geelen , Peter Nelson

The classes of even-cycle matroids, even-cycle matroids with a blocking pair, and even-cut matroids each have hundreds of excluded minors. We show that the number of excluded minors for these classes can be drastically reduced if we…

组合数学 · 数学 2020-06-02 Kevin Grace , Stefan H. M. van Zwam

We give an excluded-minor characterization for the class of matroids M in which M\e or M/e is binary for all e in E(M). This class is closely related to the class of matroids in which every member is binary or can be obtained from a binary…

组合数学 · 数学 2013-07-30 James Oxley , Jesse Taylor

In this article we disprove the conjectures asserting the positivity of the coefficients of the Ehrhart polynomial of matroid polytopes by De Loera, Haws and K\"oppe (2007) and of generalized permutohedra by Castillo and Liu (2015). We…

组合数学 · 数学 2022-03-22 Luis Ferroni

We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being…

组合数学 · 数学 2022-02-10 Kristóf Bérczi , Tamás Király , Tamás Schwarcz , Yutaro Yamaguchi , Yu Yokoi

We prove the positivity of Kazhdan-Lusztig polynomials for sparse paving matroids, which are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. The positivity follows from a remarkably simple…

组合数学 · 数学 2020-06-19 Kyungyong Lee , George D. Nasr , Jamie Radcliffe

Split matroids form a minor-closed class of matroids, and are defined by placing conditions on the system of split hyperplanes in the matroid base polytope. They can equivalently be defined in terms of structural properties involving cyclic…

组合数学 · 数学 2021-01-07 Amanda Cameron , Dillon Mayhew

We show that a simple rank-$r$ matroid with no $(t+1)$-element independent flat has at least as many elements as the matroid $M_{r,t}$ defined as the direct sum of $t$ binary projective geometries whose ranks pairwise differ by at most $1$.…

组合数学 · 数学 2020-11-13 Peter Nelson , Sergey Norin
‹ 上一页 1 2 3 10 下一页 ›