Verified computations for hyperbolic 3-manifolds
classification
🧮 math.GT
keywords
hyperbolicmethodverifiedaccountingaccumulationadmitsadmittingalgorithms
read the original abstract
For a given cusped 3-manifold $M$ admitting an ideal triangulation, we describe a method to rigorously prove that either $M$ or a filling of $M$ admits a complete hyperbolic structure via verified computer calculations. Central to our method are an implementation of interval arithmetic and Krawczyk's Test. These techniques represent an improvement over existing algorithms as they are faster, while accounting for error accumulation in a more direct and user friendly way.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.