English
Related papers

Related papers: Two enriched poset polytopes

200 papers

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…

Combinatorics · Mathematics 2022-01-26 Hidefumi Ohsugi , Akiyoshi Tsuchiya

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…

Combinatorics · Mathematics 2026-04-14 Ibrahim Ahmad , Ghislain Fourier , Michael Joswig

Stanley introduced a lattice polytope $\mathcal{C}_P$ arising from a finite poset $P$, which is called the chain polytope of $P$. The geometric structure of $\mathcal{C}_P$ has good relations with the combinatorial structure of $P$. In…

Combinatorics · Mathematics 2020-09-07 Hidefumi Ohsugi , Akiyoshi Tsuchiya

To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…

Combinatorics · Mathematics 2017-05-08 Thomas Chappell , Tobias Friedl , Raman Sanyal

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…

Combinatorics · Mathematics 2022-09-15 Aenne Benjes

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.…

Combinatorics · Mathematics 2026-05-27 Frédéric Chapoton , Christos A. Athanasiadis

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…

Combinatorics · Mathematics 2023-11-09 Matthias Beck , Max Hlavacek

The order polytopes arising from the finite poset were first introduced and studied by Stanley. For any positive integer $d\geq 14$, Liu and Tsuchiya proved that there exists a non-Ehrhart positive order polytope of dimension $d$. They also…

Combinatorics · Mathematics 2026-04-13 Feihu Liu , Guoce Xin , Zihao Zhang

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…

Combinatorics · Mathematics 2011-09-20 Federico Ardila , Thomas Bliem , Dido Salazar

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,…

Combinatorics · Mathematics 2025-03-26 Jan Stricker

We introduce in this paper the marked chain-order polytopes associated to a marked poset, generalizing the marked chain polytopes and marked order polytopes by putting them as extremal cases in an Ehrhart equivalent family. Some…

Representation Theory · Mathematics 2016-07-12 Xin Fang , Ghislain Fourier

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…

Combinatorics · Mathematics 2024-12-30 Feihu Liu , Guoce Xin , Chen Zhang

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…

Combinatorics · Mathematics 2025-05-13 Alessio D'Alì , Akihiro Higashitani

Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…

Combinatorics · Mathematics 2025-08-26 Frédéric Chapoton

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…

Combinatorics · Mathematics 2025-04-08 Ezgi Kantarcı Oğuz , Cem Yalım Özel , Mohan Ravichandran

Building from the work of von Bell et al.~(2022), we study the Ehrhart theory of order polytopes arising from a special class of distributive lattices, known as generalized snake posets. We present arithmetic properties satisfied by the…

Combinatorics · Mathematics 2026-03-02 Eon Lee , Andrés R. Vindas-Meléndez , Zhi Wang

In the last decade, the order polytope of the zigzag poset has been thoroughly studied. A related poset, called \emph{crown poset}, obtained by adding an extra relation between the endpoints of an even zigzag poset, is not so well…

Combinatorics · Mathematics 2025-12-10 Teemu Lundström , Leonardo Saud Maia Leite

Stanley (1986) introduced the order polytope and chain polytope of a partially ordered set and showed that they are related by a piecewise-linear homeomorphism. In this paper we view order and chain polytopes as instances of distributive…

Combinatorics · Mathematics 2019-11-28 Christoph Pegel , Raman Sanyal

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…

Combinatorics · Mathematics 2025-12-02 Christos A. Athanasiadis , Theo Douvropoulos , Katerina Kalampogia-Evangelinou

Given two families $X$ and $Y$ of integral polytopes with nice combinatorial and algebraic properties, a natural way to generate new class of polytopes is to take the intersection $\mathcal{P}=\mathcal{P}_1\cap\mathcal{P}_2$, where…

Combinatorics · Mathematics 2016-08-23 Takayuki Hibi , Nan Li , Teresa Xueshan Li , Lili Mu , Akiyoshi Tsuchiya
‹ Prev 1 2 3 10 Next ›