On the structure of the h-vector of a paving matroid

2010/08/12 by Criel Merino, Steven D. Noble, Merino, Criel +5 · 3 citations
Mathematics · Engineering · Computer Science · #Advanced Combinatorial Mathematics #graph theory and CDMA systems #Advanced Graph Theory Research

paper · pdf · doi:10.48550/arxiv.1008.2031

Abstract

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 lower bounds for the number of bases of a paving matroid given its rank and number of elements.

Cited by

• A Method to construct the Sparse-paving Matroids over a Finite Set
• Cycle systems, coparking functions, and h-vectors of matroids
• Sparse paving matroids, basis-exchange properties, and cyclic flats

Related

• h-vectors of small matroid complexes
• Generalized permutohedra, h-vector of cotransversal matroids and pure O-sequences
• Enumerating matroids of fixed rank
• The h-vector of a Positroid is a pure O-sequence
• Lexicographic shellability, matroids and pure order ideals