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

From MaRDI portal
Publication:848679

DOI10.1007/S00454-009-9222-YzbMATH Open1187.52023arXiv0801.2582OpenAlexW2067750936MaRDI QIDQ848679FDOQ848679


Authors: Lars Schewe Edit this on Wikidata


Publication date: 4 March 2010

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: We show that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in R^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. We construct 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.


Full work available at URL: https://arxiv.org/abs/0801.2582




Recommendations




Cites Work


Cited In (19)

Uses Software





This page was built for publication: Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848679)