Puzzles and polytope isomorphisms
Puzzles and polytope isomorphisms
复制标题
谜题和多面体同构
DOI：
10.1007/bf01830678
复制
发表时间：
1987
影响因子：
0.8
通讯作者：
P. Mani
中科院分区：
文献类型：
--
作者：
R. Blind;P. Mani
我们证明了任意维数的两个简单多面体的图之间的同构总是可以扩展到多面体本身之间的同构。研究对偶情形是很方便的，它涉及我们喜欢称之为单纯多胞形之谜的问题。
We show that an isomorphism between the graphs of two simple polytopes of arbitrary dimension can always be extended to an isomorphism between the polytopes themselves. It has been convenient to study the dual situation, involving what we like to call the puzzle of a simplicial polytope.