Download PDF

Discrete & Computational Geometry

, Volume 43, Issue 2, pp 289–302 | Cite as

Nonrealizable Minimal Vertex Triangulations of Surfaces: Showing Nonrealizability Using Oriented Matroids and Satisfiability Solvers

Article
First Online:
Received:
Revised:
Accepted:

Abstract

We show that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in ℝ3. We also provide examples of minimal vertex triangulations of closed, connected, orientable 2-manifolds of genus 5 that do not admit any polyhedral embeddings. Correcting a previous error in the literature, we construct the first infinite family of such nonrealizable triangulations of surfaces. These results were achieved by transforming the problem of finding suitable oriented matroids into a satisfiability problem. This method can be applied to other geometric realizability problems, e.g., for face lattices of polytopes.

Keywords

Polyhedral surfaces Embeddings Oriented matroids Satisfiability 
Download to read the full article text

References

  1. 1.
    Altshuler, A., Bokowski, J., Schuchert, P.: Neighborly 2-manifolds with 12 vertices. J. Comb. Theory, Ser. A 75(1), 148–162 (1996) MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Archdeacon, D., Bonnington, C.P., Ellis-Monaghan, J.A.: How to exhibit toroidal maps in space. Discrete Comput. Geom. 38(3), 573–594 (2007) MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Björner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids, 2nd edn. Encyclopedia of Mathematics and its Applications, vol. 46. Cambridge University Press, Cambridge (1999) MATHGoogle Scholar
  4. 4.
    Bokowski, J.: On heuristic methods of finding realizations of surfaces. In: Bobenko, A.I., Schröder, P., Sullivan, J.M., Ziegler, G.M. (eds.) Discrete Differential Geometry. Oberwolfach Seminars, vol. 38, pp. 255–260. Birkhäuser, Basel (2008) CrossRefGoogle Scholar
  5. 5.
    Bokowski, J., Eggert, A.: All realizations of Möbius’ torus with seven vertices. Struct. Topol. 17, 59–78 (1991) MATHMathSciNetGoogle Scholar
  6. 6.
    Bokowski, J., Guedes de Oliveira, A.: On the generation of oriented matroids. Discrete Comput. Geom. 24(2–3), 197–208 (2000) MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Bokowski, J., Sturmfels, B.: Computational Synthetic Geometry. Lecture Notes in Mathematics, vol. 1355. Springer, Berlin (1989) MATHGoogle Scholar
  8. 8.
    Bokowski, J., Grünbaum, B., Schewe, L.: Topological configurations (n 4) exist for all n≥17. Eur. J. Comb. (2009). doi: 10.1016/j.ejc.2008.12.008, posted on January 13, 2009 (to appear in print) Google Scholar
  9. 9.
    Brehm, U.: A nonpolyhedral triangulated Möbius strip. Proc. Am. Math. Soc. 89(3), 519–522 (1983) MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Brehm, U.: How to build minimal polyhedral models of the Boy surface. Math. Intell. 12(4), 51–56 (1990) MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Bremner, D.: MPC—Matroid Polytope Completion, May 2008. Available at http://www.cs.unb.ca/profs/bremner/mpc/
  12. 12.
    Bremner, D., Schewe, L.: Edge-graph diameter bounds for convex polytopes with few facets. Preprint (2008). arXiv:0809.0915
  13. 13.
    Carvalho, P., Guedes de Oliveira, A.: Intersection and linking numbers in oriented matroids. Discrete Comput. Geom. 31(2), 305–321 (2004) MATHMathSciNetGoogle Scholar
  14. 14.
    Cervone, D.P.: Vertex-minimal simplicial immersions of the Klein bottle in three space. Geom. Dedic. 50(2), 117–141 (1994) MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Császár, Á.: A polyhedron without diagonals. Acta Univ. Szeged. Sect. Sci. Math. 13, 140–142 (1949) MathSciNetGoogle Scholar
  16. 16.
    Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT, 2003. Lecture Notes in Computer Science, vol. 2919, pp. 502–518. Springer, Berlin (2004) Google Scholar
  17. 17.
    Finschi, L., Fukuda, K.: Generation of oriented matroids—a graph theoretical approach. Discrete Comput. Geom. 27(1), 117–136 (2002) MathSciNetGoogle Scholar
  18. 18.
    Gawrilow, E., Joswig, M.: Polymake: a framework for analyzing convex polytopes. In: Kalai, G., Ziegler, G.M. (eds.) Polytopes—Combinatorics and Computation, pp. 43–74. Birkhäuser, Basel (2000) Google Scholar
  19. 19.
    Grünbaum, B.: Convex Polytopes, 2nd edn. Graduate Texts in Mathematics, vol. 221. Springer, New York (2003). Prepared and with a preface by V. Kaibel, V. Klee and G.M. Ziegler Google Scholar
  20. 20.
    Gugisch, R.: Konstruktion von Isomorphieklassen orientierter Matroide. Dissertation, Universitát Bayreuth (2005) (In German) Google Scholar
  21. 21.
    Hougardy, S., Lutz, F.H., Zelke, M.: Surface realization with the intersection edge functional. Exp. Math. to appear. Available at arXiv:math.MG/0608538
  22. 22.
    Jungerman, M., Ringel, G.: Minimal triangulations on orientable surfaces. Acta Math. 145(1–2), 121–154 (1980) MATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Lutz, F.H.: Triangulated Manifolds with few Vertices and Vertex-Transitive Group Actions. Shaker, Aachen (1999) (English, with German summary). Dissertation, Technische Universität Berlin, Berlin (1999) Google Scholar
  24. 24.
    Lutz, F.H.: Enumeration and random realization of triangulated surfaces. In: Bobenko, A.I., Schröder, P., Sullivan, J.M., Ziegler, G.M. (eds.) Discrete Differential Geometry. Oberwolfach Seminars, vol. 38, pp. 235–253. Birkhäuser, Basel (2008). Available at arXiv:math.CO/0506316 CrossRefGoogle Scholar
  25. 25.
    Mahajan, Y.S., Fu, Z., Malik, S.: Zchaff2004: an efficient SAT solver. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT, 2004. Lecture Notes in Computer Science, vol. 3543, pp. 360–375. Springer, Berlin (2005) Google Scholar
  26. 26.
    McMullen, P., Schulz, C., Wills, J.M.: Polyhedral 2-manifolds in E 3 with unusually large genus. Israel J. Math. 46(1–2), 127–144 (1983) MATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    Novik, I.: A note on geometric embeddings of simplicial complexes in a Euclidean space. Discrete Comput. Geom. 23(2), 293–302 (2000) MATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    Peirce, C.S.: On the algebra of logic. Am. J. Math. 3, 15–58 (1880) CrossRefMathSciNetGoogle Scholar
  29. 29.
    Peterson, B.B.: The geometry of Radon’s theorem. Am. Math. Mon. 79, 949–963 (1972) MATHCrossRefGoogle Scholar
  30. 30.
    Peyton Jones, S.L. (ed.): Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, Cambridge (2003) Google Scholar
  31. 31.
    Radon, J.: Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten. Math. Ann. 83, 113–115 (1921). (In German) MATHCrossRefMathSciNetGoogle Scholar
  32. 32.
    Steinitz, E., Rademacher, H.: Vorlesungen über die Theorie der Polyeder. Springer, Berlin (1934) Google Scholar
  33. 33.
    Sulanke, T., Lutz, F.H.: Isomorphism free lexicographic enumeration of triangulated surfaces and 3-manifolds. Eur. J. Comb. (2009). doi: 10.1016/j.ejc.2008.12.016 Google Scholar
  34. 34.
    Timmreck, D.: Necessary conditions for geometric realizability of simplicial complexes. In: Bobenko, A.I., Schröder, P., Sullivan, J.M., Ziegler, G.M. (eds.) Discrete Differential Geometry. Oberwolfach Seminars, vol. 38, pp. 215–233. Birkhäuser, Basel (2008). Available at arXiv:0705.1912 CrossRefGoogle Scholar
  35. 35.
    Ziegler, G.M.: Polyhedral surfaces of high genus. In: Bobenko, A.I., Schröder, P., Sullivan, J.M., Ziegler, G.M. (eds.) Discrete Differential Geometry. Oberwolfach Seminars, vol. 38, pp. 191–213. Birkhäuser, Basel (2008). Available at arXiv:math.MG/0412093 CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Fachbereich MathematikTU DarmstadtDarmstadtGermany

Personalised recommendations