Advertisement

Discrete & Computational Geometry

, Volume 61, Issue 2, pp 285–302 | Cite as

On the Reconstruction of Polytopes

  • Joseph Doolittle
  • Eran Nevo
  • Guillermo Pineda-VillavicencioEmail author
  • Julien Ugon
  • David Yost
Article
  • 121 Downloads

Abstract

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.

Keywords

k-Skeleton Reconstruction Simple polytope 

Mathematics Subject Classification

Primary 52B05 Secondary 52B12 

Notes

Acknowledgements

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.

References

  1. 1.
    Blind, G., Blind, R.: The almost simple cubical polytopes. Discrete Math. 184(1–3), 25–48 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Blind, R., Mani-Levitska, P.: Puzzles and polytope isomorphisms. Aequationes Math. 34(2–3), 287–297 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Brøndsted, A.: An Introduction to Convex Polytopes. Graduate Texts in Mathematics, vol. 90. Springer, New York (1983)CrossRefzbMATHGoogle Scholar
  4. 4.
    Friedman, E.J.: Finding a simple polytope from its graph in polynomial time. Discrete Comput. Geom. 41(2), 249–256 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Fukuda, K., Miyata, H., Moriyama, S.: Complete enumeration of small realizable oriented matroids. Discrete Comput. Geom. 49(2), 359–381 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Gawrilow, E., Joswig, M.: polymake: a framework for analyzing convex polytopes. In: Kalai, G., Ziegler, G.M. (eds.) Polytopes-Combinatorics and Computation (Oberwolfach, 1997). DMV Seminar, vol. 29, pp. 43–73. Birkhäuser, Basel (2000)CrossRefGoogle Scholar
  7. 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
  8. 8.
  9. 9.
    Joswig, M.: Reconstructing a non-simple polytope from its graph. In: Kalai, G., Ziegler, G.M. (eds.) Polytopes-Combinatorics and Computation (Oberwolfach, 1997). DMV Seminar, vol. 29, pp. 167–176. Birkhäuser, Basel (2000)CrossRefGoogle Scholar
  10. 10.
    Joswig, M., Kaibel, V., Körner, F.: On the $k$-systems of a simple polytope. Isr. J. Math. 129, 109–117 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Kaibel, V.: Reconstructing a simple polytope from its graph. In: Jünger, M., et al. (eds.) Combinatorial Optimization-Eureka, You Shrink! Lecture Notes in Computer Science, vol. 2570, pp. 105–118. Springer, Berlin (2003)CrossRefGoogle Scholar
  12. 12.
    Kalai, G.: A simple way to tell a simple polytope from its graph. J. Comb. Theory Ser. A 49(2), 381–383 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Pineda-Villavicencio, G., Ugon, J., Yost, D.: The excess degree of a polytope. arXiv:1703.10702 (2017)
  14. 14.
    Pineda-Villavicencio, G., Ugon, J., Yost, D.: Polytopes close to being simple. arXiv:1704.00854 (2017)
  15. 15.
    Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.College of Liberal Arts and Sciences, University of KansasLawrenceUSA
  2. 2.Einstein Institute of MathematicsHebrew University of JerusalemJerusalemIsrael
  3. 3.Centre for Informatics and Applied OptimisationFederation University AustraliaMount HelenAustralia
  4. 4.School of Information TechnologyDeakin UniversityMelbourneAustralia

Personalised recommendations