Skip to main content

Timeline for Identify this 16 crossing knot

Current License: CC BY-SA 4.0

4 events
when toggle format what by license comment
Mar 28, 2023 at 11:48 vote accept Christoph Lamm
Mar 15, 2023 at 14:30 comment added Steven Sivek For (1), you could just iterate through NonalternatingKnotExteriors() in SnapPy. Volume computations are fast, so for every knot K whose volume was within 0.001 of M.volume(), I used M.is_isometric_to(K) to compare them. It found 16n847920 in just over 45 minutes, which is fine for isolated examples but I'd also like to know if there's a faster way.
Mar 15, 2023 at 11:43 comment added Christoph Lamm Thanks. This is already helpful. There are two remaining topics: 1) Does anyone find an identification of the above knot when we do not already have a candidate for it? (Which other tools might be successful in this case?) 2) For somebody with a local installation of Knotscape: Does the same error message occur as in Knot Finder? (And can the cause of the error message be located in the code?)
Mar 15, 2023 at 11:22 history answered Steven Sivek CC BY-SA 4.0