Timeline for What is the state of the art for algorithmic knot simplification?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 12, 2017 at 3:36 | comment | added | Ian Agol | Note that on the theoretical side, Lackenby has shown that one may untie an unknot with a polynomial number of Reidemeister moves (or grid diagram moves in Dynnikov's algorithm). This gives another proof that unknotting is in NP; however, the algorithm does not indicate how to find the moves to untie. ams.org/mathscinet-getitem?mr=3418524 see also ams.org/mathscinet-getitem?mr=3548477 | |
| Oct 26, 2013 at 10:48 | answer | added | jberge | timeline score: 3 | |
| Oct 9, 2013 at 4:10 | vote | accept | Daniel Moskovich | ||
| Oct 8, 2013 at 22:06 | comment | added | Kim Morrison | Does inviting Bob Gompf to visit count as an algorithm? | |
| Oct 7, 2013 at 14:05 | answer | added | Ryan Budney | timeline score: 6 | |
| Oct 7, 2013 at 10:49 | answer | added | Joseph O'Rourke | timeline score: 7 | |
| Oct 7, 2013 at 1:46 | comment | added | Ian Agol | When I was a grad student (maybe a bit before that report appeared), John Sullivan demonstrated a program that approximated a gradient flow of the Mobius energy. In practice, it seemed to work well unknotting the unknot, or getting stuck on a local minimum for knots. Here's a link to the video he made (I converted it to .mp4): dl.dropboxusercontent.com/u/8592391/KnotEnergies.mp4 | |
| Oct 7, 2013 at 0:35 | history | asked | Daniel Moskovich | CC BY-SA 3.0 |