Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers (Q848679)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
    scientific article

      Statements

      Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers (English)
      0 references
      0 references
      4 March 2010
      0 references
      The author shows that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in \(\mathbb{R}^3\). He also provides examples of minimal vertex triangulations of closed, connected, orientable 2-manifolds of genus 5 that do not admit any polyhedral embeddings. He constructs a new infinite family of non-realizable 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.
      0 references
      polyhedral surfaces
      0 references
      embeddings
      0 references
      oriented matroids
      0 references
      satisfiability
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers