On the structure of the -vector of a paving matroid

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 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 i...

Full description

Saved in:
Bibliographic Details
Published in:European journal of combinatorics 2012-11, Vol.33 (8), p.1787-1799
Main Authors: Merino, Criel, Noble, Steven D, Ramirez-Ibanez, Marcelino, Villarroel-Flores, Rafael
Format: Article
Language:English
Subjects:
Combinatorial analysis
Lower bounds
Paving
Proving
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 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.
ISSN:0195-6698
DOI:10.1016/j.ejc.2012.04.002