
arXiv: 1904.12095
Extending methods first used by Casson, we show how to verify a hyperbolic structure on a finite triangulation of a closed 3-manifold using interval arithmetic methods. A key ingredient is a new theoretical result (akin to a theorem by Neumann-Zagier and Moser for ideal triangulations upon which HIKMOT is based) showing that there is a redundancy among the edge equations if the edges avoid "gimbal lock". We successfully test the algorithm on known examples such as the orientable closed manifolds in the Hodgson-Weeks census and the bundle census by Bell. We also tackle a previously unsolved problem and determine all knots and links with up to 14 crossings that have a hyperbolic branched double cover.
28 pages, 11 figures; version 2 addresses referee's comments
Mathematics - Geometric Topology, General methods in interval analysis, 57M50, 65G40, General geometric structures on low-dimensional manifolds, triangulations, FOS: Mathematics, Geometric Topology (math.GT), hyperbolic structures, 3-manifolds
Mathematics - Geometric Topology, General methods in interval analysis, 57M50, 65G40, General geometric structures on low-dimensional manifolds, triangulations, FOS: Mathematics, Geometric Topology (math.GT), hyperbolic structures, 3-manifolds
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
