Timeline for Why is it so hard to implement Haken's Algorithm for knot theory?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 23, 2012 at 19:15 | comment | added | Ryan Budney | BTW, as of Regina release 4.93 the "big red button" is there. Load a 3-manifold triangulation then button under Recognition -> Solid torus. | |
| Apr 19, 2011 at 17:02 | vote | accept | Hu Yi Chen | ||
| Jan 27, 2011 at 17:33 | history | edited | Sam Nead | CC BY-SA 2.5 |
typo
|
| Jan 27, 2011 at 2:19 | comment | added | Ben Burton | The source code is all online at regina.sourceforge.net (though warning: there's a lot of it). For a human-readable overview, arXiv:0808.4050 and arXiv:0901.2629 describe the normal surface / vertex enumeration code, which is the computational bottleneck for Haken's algorithm. To run the full procedure: start with a triangulated knot complement (imports from SnapPea are ok), simplify the triangulation to give only two boundary faces, enumerate all vertex normal surfaces, filter out discs using Euler char., then check boundary edge weights to see if any have non-trivial boundary. | |
| Jan 27, 2011 at 1:52 | comment | added | Bill Thurston | Very nice. I'd be interested in seeing the code, especially if the "big red button" is installed, but even without. | |
| Jan 27, 2011 at 0:00 | comment | added | Ryan Budney | And thanks for finally logging into MO, Ben. :) | |
| Jan 26, 2011 at 23:46 | history | answered | Ben Burton | CC BY-SA 2.5 |