Order-chain polytopes

DOI10.26493/1855-3974.1164.2F7zbMATH Open1419.52010arXiv1504.01706OpenAlexW2963320607MaRDI QIDQ5225041FDOQ5225041

Teresa Xueshan Li, Nan Li, Lili Mu, Akiyoshi Tsuchiya, Takayuki Hibi

Publication date: 25 July 2019

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Abstract: 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 $mathcalP=mathcal{P}_{1}capmathcal{P}_2$, where $mathcal{P}_{1}inX$, $mathcal{P}_{2}inY$. Two basic questions then arise: 1) when $mathcalP$ is integral and 2) whether $mathcalP$ inherits the "old type" from $mathcal{P}_1,mathcal{P}_2$ or has a "new type", that is, whether $mathcalP$ is unimodularly equivalent to some polytope in $XcupY$ or not. In this paper, we focus on the families of order polytopes and chain polytopes and create a new class of polytopes following the above framework, which are named order-chain polytopes. In the study on their volumes, we discover a natural relation with Ehrenborg and Mahajan's results on maximizing descent statistics.

Full work available at URL: https://arxiv.org/abs/1504.01706

Recommendations

• Marked chain-order polytopes
• Ordering polygonal chains with respect to Hosoya index
• Structural aspects of ordered polymatroids
• The Order Dimension of Convex Polytopes
• Enriched chain polytopes
• Facets of the linear ordering polytope
• Unimodular equivalence of order and chain polytopes
• Multipolytopes and convex chains
• Primary facets of order polytopes
• Extensions of partial cyclic orders and consecutive coordinate polytopes

zbMATH Keywords

volumeunimodular equivalenceposetorder-chain polytope

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Cites Work

• polymake: a framework for analyzing convex polytopes
• Gröbner Bases
• Lattice 3-polytopes with few lattice points
• Decompositions of Rational Convex Polytopes
• Title not available (Why is that?)
• Two poset polytopes
• Normal polytopes arising from finite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
• Sign Hibi cones and the anti-row iterated Pieri algebras for the general linear groups
• Unimodular equivalence of order and chain polytopes
• On positivity of Ehrhart polynomials
• Maximizing the descent statistic
• Maximizing Möbius functions on subsets of Boolean algebras
• Chain polytopes and algebras with straightening laws
• Reflexive polytopes arising from perfect graphs
• Singular loci of Bruhat-Hibi toric varieties

Cited In (14)

• Vertical order in the Hilbert cube
• Gröbner fans of Hibi ideals, generalized Hibi ideals and flag varieties
• Structural aspects of ordered polymatroids
• Two poset polytopes
• Levelness of Order Polytopes
• Enriched order polytopes and enriched Hibi rings
• Marked chain-order polytopes
• Chain polytopes and algebras with straightening laws
• CLASSIFYING POLYGONAL CHAINS OF SIX SEGMENTS
• Title not available (Why is that?)
• Triangulations, Order Polytopes, and Generalized Snake Posets
• Relative poset polytopes and semitoric degenerations
• The reflexive dimension of (0, 1)-polytopes
• The numbers of edges of the order polytope and the chain polytope of a finite partially ordered set

Uses Software

• polymake

This page was built for publication: Order-chain polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225041)