Timeline for Lower bound on number of tetrahedra needed to triangulate a knot complement
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 14, 2022 at 22:00 | comment | added | Calvin McPhail-Snyder | The octahedral decomposition triangulates a diagram with $c$ crossings using $4c$ or $5c$ tetrahedra (there are two variants) so one explicitly has $t(K) \le 4c(K)$. | |
| Mar 14, 2022 at 21:40 | history | edited | David Roberts♦ | CC BY-SA 4.0 |
fixed arxiv front-end link, gave title
|
| Nov 20, 2010 at 15:49 | vote | accept | Mark Bell | ||
| Nov 19, 2010 at 2:45 | history | edited | Ian Agol | CC BY-SA 2.5 |
added 383 characters in body
|
| Nov 16, 2010 at 17:21 | history | edited | Ian Agol | CC BY-SA 2.5 |
added 1800 characters in body
|
| Nov 16, 2010 at 7:10 | history | edited | Ian Agol | CC BY-SA 2.5 |
added 5 characters in body
|
| Nov 16, 2010 at 6:50 | history | answered | Ian Agol | CC BY-SA 2.5 |