Algorithmic unsolvability of the triviality problem for multidimensional knots
From MaRDI portal
Publication:1816439
DOI10.1007/BF02566428zbMath0862.57017OpenAlexW2071250698MaRDI QIDQ1816439
Alexander Nabutovsky, Shmuel Weinberger
Publication date: 25 May 1997
Published in: Commentarii Mathematici Helvetici (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/140406
Related Items
Computing All Maps into a Sphere ⋮ Hardness of embedding simplicial complexes in \(\mathbb R^d\) ⋮ Extendability of continuous maps is undecidable ⋮ Computability Theory and Differential Geometry ⋮ Complexity of unknotting of trivial 2-knots ⋮ Algebraic cycles from a computational point of view ⋮ Quantitative algebraic topology and Lipschitz homotopy ⋮ Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry ⋮ Sizes of spaces of triangulations of 4-manifold and balanced presentations of the trivial group ⋮ Computing all maps into a sphere
