Triangular faces of the order and chain polytope of a maximal ranked poset
Combinatorics
2025-03-17 v3
Abstract
Let and denote the order polytope and chain polytope, respectively, associated with a finite poset . We prove the following result: if is a maximal ranked poset, then the number of triangular -faces of is less than or equal to that of , with equality holding if and only if does not contain an -poset as a subposet.
Cite
@article{arxiv.2404.00263,
title = {Triangular faces of the order and chain polytope of a maximal ranked poset},
author = {Aki Mori},
journal= {arXiv preprint arXiv:2404.00263},
year = {2025}
}
Comments
7 pages, 1 figure