Abstract
It is not known whether there exists a computable function bounding the number of Pachner moves needed to connect any two triangulations of a compact 3-manifold. In this paper we ?nd an explicit bound of this kind for all Haken 3-manifolds that contain no ?bred submanifolds as strongly simple pieces of their JSJ-decomposition. The explicit formula for the bound is in terms of the number of tetrahedra in the two triangulations. This implies a conceptually trivial algorithm for recognising any non?bred knot complement among all 3-manifolds.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
