Order-chain polytopes

From MaRDI portal
(Redirected from Publication:5225041)




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=mathcalP1capmathcalP2, where mathcalP1inX, mathcalP2inY. Two basic questions then arise: 1) when mathcalP is integral and 2) whether mathcalP inherits the "old type" from mathcalP1,mathcalP2 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.





Describes a project that uses

Uses Software






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)