Linear inequalities for flags in graded posets

Details Linear inequalities for flags in graded posets Linear inequalities for flags in graded posets

1997-06-25

arxiv.org/abs/math/9706220v1

Mathematics

Combinatorics

Scientific paper

The closure of the convex cone generated by all flag $f$-vectors of graded posets is shown to be polyhedral. In particular, we give the facet inequalities to the polar cone of all nonnegative chain-enumeration functionals on this class of posets. These are in one-to-one correspondence with antichains of intervals on the set of ranks and thus are counted by Catalan numbers. Furthermore, we prove that the convolution operation introduced by Kalai assigns extreme rays to pairs of extreme rays in most cases. We describe the strongest possible inequalities for graded posets of rank at most 5.

Affiliated with

Also associated with

No associations

Rating

Linear inequalities for flags in graded posets 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 Linear inequalities for flags in graded posets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear inequalities for flags in graded posets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-70329