Decision problems for 3-manifolds and their fundamental groups
DOI10.2140/GTM.2015.19.201zbMATH Open1336.57001arXiv1405.6274OpenAlexW2963505743MaRDI QIDQ906847FDOQ906847
Authors: Matthias Aschenbrenner, Stefan Friedl, Henry Wilton
Publication date: 29 January 2016
Full work available at URL: https://arxiv.org/abs/1405.6274
Recommendations
- The membership problem for 3-manifold groups is solvable
- Conjugacy problem in groups of oriented geometrizable 3-manifolds
- The conjugacy problem in groups of non-orientable 3-manifolds
- Undecidability of the freedom problem for 3-manifold groups.
- The computational complexity of basic decision problems in 3-dimensional topology
algorithmsTuring machineword problem3-manifoldsdecision problemsfinitely presented groupshomeomorphism problem
Generators, relations, and presentations of groups (20F05) Fundamental group, presentations, free differential calculus (57M05) Topological methods in group theory (57M07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Research exposition (monographs, survey articles) pertaining to manifolds and cell complexes (57-02) Word problems, etc. in computability and recursion theory (03D40)
Cited In (28)
- An explicit relation between knot groups in lens spaces and those in S3
- VIRTUAL ALGEBRAIC FIBRATIONS OF KÄHLER GROUPS
- Undecidability of the freedom problem for 3-manifold groups.
- Spines and surgery descriptions of graph manifolds
- Title not available (Why is that?)
- 2-stratifold spines of closed 3-manifolds
- The picture problem for 3-complexes.
- Title not available (Why is that?)
- Algorithms for contractibility of compressed curves on 3-manifold boundaries
- Title not available (Why is that?)
- A solution of the decision problem for the Lewis systems S2 and S4, with an application to topology
- The membership problem for 3-manifold groups is solvable
- Computational complexity and 3-manifolds and zombies
- The word problem in a class of non-Haken 3-manifolds
- Conjugacy problem in groups of oriented geometrizable 3-manifolds
- An application of Poénaru's ``zipping theory
- 2-stratifold groups have solvable word problem
- Thurston's vision and the virtual fibering theorem for 3-manifolds
- Decision problems in the space of Dehn fillings
- Simply connected 3-manifolds and undecidable problems in group theory.
- Geometry of the word problem for 3-manifold groups
- The planar Cayley graphs are effectively enumerable. II
- All Dehn Fillings of the Whitehead Link Complement are Tetrahedron Manifolds
- Search and witness problems in group theory.
- Around 3-manifold groups
- Recognizing Euclidean space forms with minimal fundamental tetrahedra
- The computational complexity of basic decision problems in 3-dimensional topology
- Title not available (Why is that?)
This page was built for publication: Decision problems for 3-manifolds and their fundamental groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906847)