Necessary Conditions for Geometric Realizability of Simplicial Complexes

zbMATH Open1145.57020arXiv0705.1912MaRDI QIDQ3499997FDOQ3499997

Authors: Dagmar Timmreck 

Publication date: 3 June 2008

Abstract: We associate with any simplicial complex $K$ and any integer $m$ a system of linear equations and inequalities. If $K$ has a simplicial embedding in $R^m$ then the system has an integer solution. This result extends the work of I. Novik (2000).

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

Recommendations

• A note on geometric embeddings of simplicial complexes in a Euclidean space
• Nonrealizability proofs in computational geometry
• Realizability of polytopes as a low rank matrix completion problem
• scientific article; zbMATH DE number 3920535
• Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers

zbMATH Keywords

intersection cocycleimbedding cocyleobstruction polytope

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Computational aspects related to convexity (52B55) Embeddings and immersions in PL-topology (57Q35)

Cited In (6)

• Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
• Buchstaber invariants of skeleta of a simplex
• Title not available (Why is that?)
• Adjacency graphs of polyhedral surfaces
• Title not available (Why is that?)
• The geometric realization of a simplicial Hausdorff space is Hausdorff

Uses Software

• SCIP

This page was built for publication: Necessary Conditions for Geometric Realizability of Simplicial Complexes

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