Extendability of simplicial maps is undecidable

DOI10.1007/s00454-022-00454-0OpenAlexW4310993684MaRDI QIDQ2679605

Arkadij B. Skopenkov

Publication date: 23 January 2023

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

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

zbMATH Keywords

undecidabilityretractionhomotopywedge of spheresextendability of continuous mapsWhitehead map

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer science (68-XX) PL-topology (57Qxx)

Related Items

Some `converses' to intrinsic linking theorems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hardness of embedding simplicial complexes in \(\mathbb R^d\)
• Invariants of graph drawings in the plane
• Differentiable links
• Quasi embeddings and embeddings of polyhedra in \(\mathbb{R}{}^ m\)
• Extendability of continuous maps is undecidable
• Embeddability of Simplicial Complexes is Undecidable
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• Some `converses' to intrinsic linking theorems