Computing a Link Diagram from its Exterior
| Autor: | Dunfield, Nathan M., Obeidin, Malik, Rudd, Cameron Gates |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | Proceedings of the 38th International Symposium on Computational Geometry (SoCG 2022), pages 37:1--37:24 |
| Druh dokumentu: | Working Paper |
| DOI: | 10.4230/LIPIcs.SoCG.2022.37 |
| Popis: | A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by planar diagrams, whereas their exteriors, which are compact 3-manifolds with torus boundary, are encoded by triangulations. Here, we give the first practical algorithm for finding a diagram of a knot given a triangulation of its exterior. Our method applies to links as well as knots, allows us to recover links with hundreds of crossings. We use it to find the first diagrams known for 23 principal congruence arithmetic link exteriors; the largest has over 2,500 crossings. Other applications include finding pairs of knots with the same 0-surgery, which relates to questions about slice knots and the smooth 4D Poincar\'e conjecture. Comment: 34 pages, 29 figures; V2 as appeared in "Proceedings of the 38th International Symposium on Computational Geometry (SoCG 2022)"; V3 restructured journal version, to appear in "Discrete & Computational Geometry" |
| Databáze: | arXiv |
| Externí odkaz: |
|