On the Reconstruction of Polytopes
- 121 Downloads
Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its 1-skeleton. Call a vertex of a d-polytope nonsimple if the number of edges incident to it is more than d. We show that (1) the face lattice of any d-polytope with at most two nonsimple vertices is determined by its 1-skeleton; (2) the face lattice of any d-polytope with at most \(d-2\) nonsimple vertices is determined by its 2-skeleton; and (3) for any \(d>3\) there are two d-polytopes with \(d-1\) nonsimple vertices, isomorphic \((d-3)\)-skeleta and nonisomorphic face lattices. In particular, the result (1) is best possible for 4-polytopes.
Keywordsk-Skeleton Reconstruction Simple polytope
Mathematics Subject ClassificationPrimary 52B05 Secondary 52B12
We thank Micha Perles for helpful discussions and the referees for many valuable comments and suggestions. Guillermo Pineda would like to thank Michael Joswig for the hospitality at the Technical University of Berlin and for many fruitful discussions on the topics of this research. Joseph Doolittle would like to thank Margaret Bayer for pushing for more results and keeping the direction of exploration straight.
- 7.Grünbaum, B.: Convex Polytopes. 2nd ed. Graduate Texts in Mathematics, vol. 221. Springer, New York (2003). Prepared and with a preface by V. Kaibel, V. Klee and G.M. ZieglerGoogle Scholar
- 13.Pineda-Villavicencio, G., Ugon, J., Yost, D.: The excess degree of a polytope. arXiv:1703.10702 (2017)
- 14.Pineda-Villavicencio, G., Ugon, J., Yost, D.: Polytopes close to being simple. arXiv:1704.00854 (2017)