Decision problems for 3-manifolds and their fundamental groups

DOI10.2140/gtm.2015.19.201zbMath1336.57001arXiv1405.6274OpenAlexW2963505743MaRDI QIDQ906847

Matthias Aschenbrenner, Stefan Friedl, Henry Wilton

Publication date: 29 January 2016

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

algorithms 3-manifolds decision problems word problem finitely presented groups Turing machine homeomorphism problem

Generators, relations, and presentations of groups (20F05) Topological methods in group theory (57M07) Complexity of computation (including implicit computational complexity) (03D15) Fundamental group, presentations, free differential calculus (57M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Research exposition (monographs, survey articles) pertaining to manifolds and cell complexes (57-02) Turing machines and related notions (03D10)

Related Items (13)

An application of Poénaru's ``zipping theory ⋮ All Dehn Fillings of the Whitehead Link Complement are Tetrahedron Manifolds ⋮ 2-stratifold groups have solvable word problem ⋮ 2-stratifold spines of closed 3-manifolds ⋮ An explicit relation between knot groups in lens spaces and those in S3 ⋮ Spines and surgery descriptions of graph manifolds ⋮ Algorithms for contractibility of compressed curves on 3-manifold boundaries ⋮ The planar Cayley graphs are effectively enumerable. II ⋮ Unnamed Item ⋮ Thurston's vision and the virtual fibering theorem for 3-manifolds ⋮ Computational complexity and 3-manifolds and zombies ⋮ Around 3-manifold groups ⋮ VIRTUAL ALGEBRAIC FIBRATIONS OF KÄHLER GROUPS

This page was built for publication: Decision problems for 3-manifolds and their fundamental groups