Linear inequalities for flags in graded posets
Combinatorics
2016-09-07 v1
Abstract
The closure of the convex cone generated by all flag -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.
Keywords
Cite
@article{arxiv.math/9706220,
title = {Linear inequalities for flags in graded posets},
author = {Louis J. Billera and Gábor Hetyei},
journal= {arXiv preprint arXiv:math/9706220},
year = {2016}
}