Marked chain-order polytope face-number monotonicity conjecture
Marked chain-order polytope face-number monotonicity conjecture
Let be a regular marked poset, and let denote the set of star elements. An admissible decomposition of is a pair with , , and no element of covered by an element of ; write for the associated marked chain-order polytope. Let and be admissible decompositions such that
for . Marked chain-order polytope face-number monotonicity conjecture. For every , the number of -dimensional faces of is greater than or equal to the number of -dimensional faces of . This generalizes the Stanley–Hibi–Li conjecture and related conjectures for marked chain and marked order polytopes; the facet case follows from the paper's preceding theorem, while the asserted inequalities in all dimensions remain open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Xin Fang and Ghislain Fourier, “Marked chain-order polytopes”, arXiv:1508.02232 (2016).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.