Papers
Topics
Authors
Recent
Search
2000 character limit reached

2-levelness of Marked Poset Polytopes and the Ehrhart polynomial

Published 15 Jan 2024 in math.CO | (2401.07492v2)

Abstract: It is already known that order polytopes and chain polytopes are always 2-level polytopes. In general, this is not true for marked order and marked chain polytopes. We study the geometry of marked order polytopes, marked chain polytopes, and marked chain-order polytopes, providing a comprehensive characterisation of 2-levelness for these polytopes. Furthermore, we present an exact formula for the Ehrhart polynomial of marked order polytopes. Because of their connection to marked chain and marked chain-order polytopes, this polynomial is also the Ehrhart polynomial of these polytopes.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.