Unimodular equivalence of order and chain polytopes
By Takayuki Hibi, Nan Li. 2012
47 citations recorded by the source corpus.
The problem when the order polytope and the chain polytope of a finite partially ordered set are unimodularly equivalent will be solved.
Subfields: Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/c5b04b34d6afd94b28966163b763fd4128ceea5c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
In Electrical and Electronic Engineering
In Geometry and Topology
Citations in the corpus
- Algebraic and Geometric Methods in Enumerative Combinatorics (2014, background): “not metrically, or even combinatorially equivalent in general. There is a nice characterization of the posets Psuch that O(P) and C(P) may be obtained from one another by a unimodular change of basis [HL12]. 11.(Root polytope): A d 1: Ehr A d (z) = P d k=0 d k 2 zk (1 x)d ; vol(A d) = 2d d d! : Ther”