Related papers: Two double poset polytopes

In 1986 Stanley associated to a poset the order polytope. The close interplay between its combinatorial and geometric properties makes the order polytope an object of tremendous interest. Double posets were introduced in 2011 by Malvenuto…

Stanley introduced in 1986 the order polytope and the chain polytope for a given finite poset. These polytopes contain much information about the poset and have given rise to important examples in polyhedral geometry. In 1993, Reiner…

Stanley (1986) showed how a finite partially ordered set gives rise to two polytopes, called the order polytope and chain polytope, which have the same Ehrhart polynomial despite being quite different combinatorially. We generalize his…

Stanley introduced and studied two lattice polytopes, the order polytope and chain polytope, associated to a finite poset. Recently Ohsugi and Tsuchiya introduce an enriched version of them, called the enriched order polytope and enriched…

The order and chain polytopes, introduced by Richard P. Stanley, form a pair of Ehrhart equivalent polytopes associated to a given finite poset. A conjecture by Takayuki Hibi and Nan Li states that the $f$-vector of the chain polytope…

In the early 1970's, Richard Stanley and Kenneth Johnson introduced and laid the groundwork for studying the order polynomial of partially ordered sets (posets). Decades later, Hamaker, Patrias, Pechenik, and Williams introduced the term…

We study a class of polyhedra associated to marked posets. Examples of these polyhedra are Gelfand-Tsetlin polytopes and cones, as well as Berenstein-Zelevinsky polytopes, all of which have appeared in the representation theory of…

Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…

Order polytopes of posets have been a very rich topic at the crossroads between combinatorics and discrete geometry since their definition by Stanley in 1986. Among other notable results, order polytopes of graded posets are known to be…

This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…

In this paper, we provide an overview of Ehrhart polynomials associated with order polytopes of finite posets, a concept first introduced by Stanley. We focus on their combinatorial interpretations for many sequences listed on the OEIS. We…

We study generating functions of strict and non-strict order polynomials of series-parallel posets, called order series. These order series are closely related to Ehrhart series and h*-polynomials of the associated order polytopes. We…

We study two different objects attached to an arbitrary quadrangulation of a regular polygon. The first one is a poset, closely related to the Stokes polytopes introduced by Baryshnikov. The second one is a set of some paths configurations…

Since their introduction by Stanley~\cite{StanleyOrderPoly} order polytopes have been intriguing mathematicians as their geometry can be used to examine (algebraic) properties of finite posets. In this paper, we follow this route to examine…

Several recent papers have explored families of rational polyhedra whose integer points are in bijection with certain families of numerical semigroups. One such family, first introduced by Kunz, has integer points in bijection with…

Stanley introduced two classes of lattice polytopes associated to posets, which are called the order polytope ${\mathcal O}_P$ and the chain polytope ${\mathcal C}_P$ of a poset $P$. It is known that, given a poset $P$, the Ehrhart…

The combinatorial mutation $\mathrm{mut}_w(P,F)$ for a lattice polytope $P$ was introduced in the context of mirror symmetry for Fano manifolds in [1]. It was also proved in [1] that for a lattice polytope $P \subseteq N_\mathbb{R}$…

We introduce Lipschitz functions on a finite partially ordered set $P$ and study the associated Lipschitz polytope $L(P)$. The geometry of $L(P)$ can be described in terms of descent-compatible permutations and permutation statistics that…

We extend the notion of parking function polytopes and study their geometric and combinatorial structure, including normal fans, face posets, and $h$-polynomials, as well as their connections to other classes of polytopes. To capture their…

We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehrhart quasi-polynomial. Our construction is based on circular…