paper

-Shellability of Discrete Polymatroids

arXiv:1012.1075

Abstract

In this note we show that every discrete polymatroid is -shellable. This gives, in a partial case, a positive answer to a conjecture of Chari and improves a recent result of Schweig where he proved that the -vector of a lattice path matroid satisfies a conjecture of Stanley.

4 pages

$M$-Shellability of Discrete Polymatroids · wovepaper