Timeline for can you fool SnapPea?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Apr 17, 2022 at 8:25 | history | suggested | The Amplitwist | CC BY-SA 4.0 |
fixed broken link to springerlink.com
|
| Apr 17, 2022 at 7:29 | review | Suggested edits | |||
| S Apr 17, 2022 at 8:25 | |||||
| Feb 14, 2016 at 11:10 | comment | added | Sam Nead | I have vivid memories from attending a real estate marketing seminar given by the great Mr Slugbate. One pearl of wisdom: if you live in the Gieseking manifold (very affordable, by the way), and if you stroll through a face of the two-skeleton every time you drink a beer, then you can figure out the parity of the number of beers by checking if your heart is on the left or on the right. | |
| Feb 13, 2016 at 18:03 | comment | added | Ryan Budney | @RobertHaraway: right, that's who I was thinking of. I contacted Mel a few years ago and confirmed he is not Mr. Nead. | |
| Feb 13, 2013 at 2:47 | comment | added | Robert Haraway | @Ryan Budney: I believe you're referring to Mel Slugbate; cf. euclid.colorado.edu/~jnc/MelSlugbate.html | |
| Nov 11, 2009 at 0:22 | history | edited | Sam Nead | CC BY-SA 2.5 |
added discussion of actual experiments ie plugging unknots into SnapPea.
|
| Nov 10, 2009 at 23:34 | comment | added | Sam Nead | 1. I will be very happy to sell you as much as you wish to buy. I also have some lightly used Seifert fibred spaces. 2. That wasn't my comment (I don't think) but the round-off error may not be where you think it is. A random knot (for various values of random) will have no short geodesics. So probably the triangulation, while having lots of tetrahedra, has no very flat or very close to degenerate tetrahedra. So you can find the volume with reasonable confidence. What you cannot do is compute the Dirichlet domain: once the volume is large you'll have too many vertices, too close together. | |
| Nov 10, 2009 at 23:08 | comment | added | Ryan Budney | BTW it was your comment about choosing 30 vertices randomly in the plane to create a random knot that got me thinking about this again. In general a 30 vertex knot should have something like 28! crossings? There's got to be a decent probability of things like round-off error for SnapPea's approach to the gluing equations, let alone the problem of triangulating those monster diagrams. | |
| Nov 10, 2009 at 23:03 | comment | added | Ryan Budney | Are you the guy that's always trying to sell people hyperbolic real-estate? | |
| Nov 10, 2009 at 23:01 | history | answered | Sam Nead | CC BY-SA 2.5 |