Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
From MaRDI portal
(Redirected from Publication:848679)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 30658 (Why is no real title available?)
- scientific article; zbMATH DE number 3509333 (Why is no real title available?)
- scientific article; zbMATH DE number 1952947 (Why is no real title available?)
- scientific article; zbMATH DE number 2008526 (Why is no real title available?)
- scientific article; zbMATH DE number 2245884 (Why is no real title available?)
- scientific article; zbMATH DE number 3058368 (Why is no real title available?)
- A Nonpolyhedral Triangulated Mobius Strip
- A note on geometric embeddings of simplicial complexes in a Euclidean space
- Computational synthetic geometry
- Discrete Differential Geometry
- Edge-graph diameter bounds for convex polytopes with few facets
- Enumeration and random realization of triangulated surfaces
- Generation of oriented matroids --- a graph theoretical approach
- How to build minimal polyhedral models of the Boy surface
- How to exhibit toroidal maps in space
- Intersection and linking numbers in oriented matroids
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
- Minimal triangulations on orientable surfaces
- Necessary Conditions for Geometric Realizability of Simplicial Complexes
- Neighborly 2-manifolds with 12 vertices
- On the generation of oriented matroids
- Oriented Matroids
- Polyhedral 2-manifolds in \(E^ 3\) with unusually large genus
- Polyhedral surfaces of high genus
- Surface realization with the intersection segment functional
- The Geometry of Radon's Theorem
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Topological configurations \((n_4)\) exist for all \(n\geq 17\)
- Triangulated manifolds with few vertices and vertex-transitive group actions
- Vertex-minimal simplicial immersions of the Klein bottle in three space
- polymake: a framework for analyzing convex polytopes
Cited in
(19)- Edge-graph diameter bounds for convex polytopes with few facets
- Geometric realization of a triangulation on the projective plane with one face removed
- scientific article; zbMATH DE number 4015578 (Why is no real title available?)
- A proof of the strict monotone 5-step conjecture
- scientific article; zbMATH DE number 3919372 (Why is no real title available?)
- Non-existence of polyhedral immersions of triangulated surfaces in \(\mathbb R^3\)
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Embedding dimensions of simplicial complexes on few vertices
- Discrete Differential Geometry
- Necessary Conditions for Geometric Realizability of Simplicial Complexes
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- On the generation of oriented matroids
- Satisfiability problems in discrete geometry
- More bounds on the diameters of convex polytopes
- Generalized Heawood numbers
- Neighborly 2-manifolds with 12 vertices
- Vertex-transitive polyhedra of higher genus. I
- The complete enumeration of 4-polytopes and 3-spheres with nine vertices
- Minimal triangulations of two-dimensional manifolds
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)
