$M$-Shellability of Discrete Polymatroids

Details $M$-Shellability of Discrete Polymatroids $M$-Shellability of Discrete Polymatroids

2010-12-06

arxiv.org/abs/1012.1075v1

Mathematics

Combinatorics

4 pages

Scientific paper

In this note we show that every discrete polymatroid is $M$-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 $h$-vector of a
lattice path matroid satisfies a conjecture of Stanley.

Affiliated with

Also associated with

No associations

Rating

$M$-Shellability of Discrete Polymatroids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with $M$-Shellability of Discrete Polymatroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and $M$-Shellability of Discrete Polymatroids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-167102