Timeline for Triangulations of polyhedra
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 6, 2021 at 16:59 | comment | added | Francisco Santos | As Pak and O'Rourke point below, the asymptotics of the number of triangulations of cyclic polytopes is more or less known, and covered in my book on Triangulations with de Loera and Rambau. But the original question is about the exact number of triangulations of the cyclic 3-polytope with n vertices. I just want to point out that a nice closed formula for that could exist, although we do not know it. Related to this, I have a paper where we compute the exact number of triangulations of the cyclic d-polytope with d+4 vertices (doi.org/10.1007/s00454-001-0050-y) | |
| Nov 16, 2010 at 17:24 | history | edited | Joseph O'Rourke |
added polytopes tag
|
|
| Nov 16, 2010 at 17:24 | answer | added | Joseph O'Rourke | timeline score: 4 | |
| Nov 13, 2010 at 1:00 | answer | added | Dr Shello | timeline score: 1 | |
| Nov 12, 2010 at 20:10 | vote | accept | Jonah Ostroff | ||
| Nov 12, 2010 at 20:00 | answer | added | Igor Pak | timeline score: 21 | |
| Nov 12, 2010 at 19:45 | history | asked | Jonah Ostroff | CC BY-SA 2.5 |