Timeline for Triangulating hypercubes
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5, 2022 at 10:57 | comment | added | Wlod AA | Hmm, in the early of 1996 I've got a triangulation of n-cube into n! of n-simplexes; it feels as something canonical. | |
| S Oct 5, 2022 at 9:52 | history | suggested | The Amplitwist | CC BY-SA 4.0 |
fixed broken link to springerlink.com; added full citations in tooltips; used displaystyle formatting for displayed formula; added apostrophe to shortened year
|
| Oct 5, 2022 at 7:54 | review | Suggested edits | |||
| S Oct 5, 2022 at 9:52 | |||||
| Sep 27, 2013 at 18:39 | answer | added | Francisco Santos | timeline score: 7 | |
| Feb 10, 2011 at 16:54 | comment | added | Joseph O'Rourke | See also "Simplexity of the $n$-cube" at The Open Problems Garden: garden.irmacs.sfu.ca/?q=op/simplexity_of_the_cube | |
| Feb 10, 2011 at 16:12 | answer | added | Matthew Kahle | timeline score: 4 | |
| Feb 10, 2011 at 15:45 | history | edited | S. Carnahan♦ | CC BY-SA 2.5 |
Correct lower bound does not rapidly approach zero.
|
| Feb 10, 2011 at 13:41 | vote | accept | Nick Loughlin | ||
| Feb 10, 2011 at 13:23 | answer | added | Greg Kuperberg | timeline score: 16 | |
| Feb 10, 2011 at 13:05 | answer | added | Scott Carter | timeline score: 2 | |
| Feb 10, 2011 at 12:58 | history | asked | Nick Loughlin | CC BY-SA 2.5 |