Timeline for Measuring the complexity of a knot by minimum number of simplices to tile the complement
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jan 11, 2012 at 23:40 | history | edited | John Pardon | CC BY-SA 3.0 |
pointed out duplicate
|
| Jan 11, 2012 at 5:42 | comment | added | Ian Agol | This is essentially a duplicate of this question: mathoverflow.net/questions/46149/… Translating between ideal triangulations and triangulations with boundary is a linear procedure. | |
| Jan 11, 2012 at 5:34 | comment | added | Ian Agol | @ Will: Yes, by the knot complement problem. | |
| Jan 11, 2012 at 3:03 | comment | added | Will Sawin | Shouldn't there be finitely many arrangements of $n$ simplices, therefore finitely many complements, therefore finitely many knots, therefore a bound on the crossing number? | |
| Jan 11, 2012 at 2:24 | history | asked | John Pardon | CC BY-SA 3.0 |