On a computer recognition of 3-manifolds
Sergei V. Matveev
Abstract
We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3-manifolds up to complexity 8. The program can treat also not necessarily closed 3-manifolds of bigger complexities, but here some unrecognizable (by the program) 3-manifolds may occur.
Create a lesson
Related papers
Linearity of Graph Manifold Groups
Daniel T. Wise
Finding the Birman-Series set
Peter Buser, Hugo Parlier
Thurston's Legacy at the Interface of Surface Dynamics, Train Tracks, and Arithmetic
Ahmad Rafiqi, Ayberk Zeytin
Recognizing oriented knots from finite quotients with one marked element
Indranil Biswas, Shrinit Singh
Symmetries of colored Khovanov-Rozansky homology
Alexis Guérin, Felix Roz
The Colored Jones Function does not determine any colored Links--Gould polynomial
Matthew Harper, Ben-Michael Kohli