Timeline for How many unit simplices are needed to cover a unit $n$-cube?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 24, 2015 at 23:11 | answer | added | Yoav Kallus | timeline score: 3 | |
| Apr 9, 2015 at 2:44 | answer | added | Jan Kyncl | timeline score: 2 | |
| Apr 9, 2015 at 2:36 | comment | added | Jan Kyncl | I asked the latter question here: mathoverflow.net/questions/139161/…. | |
| Apr 8, 2015 at 19:53 | answer | added | The Masked Avenger | timeline score: 3 | |
| Apr 8, 2015 at 1:16 | answer | added | Robert Israel | timeline score: 4 | |
| Apr 8, 2015 at 0:29 | answer | added | Joseph O'Rourke | timeline score: 2 | |
| Apr 7, 2015 at 15:55 | comment | added | The Masked Avenger | True, but the latter question has a nice candidate based on the height h of the n+1 simplex. If c_n is the side length for a cube in scribed in an n simplex, a lower bound for c_n+1 (=c) comes from the relations c +rh=h and c= rc_n. | |
| Apr 7, 2015 at 15:13 | comment | added | Joseph O'Rourke | @TheMaskedAvenger: Nice idea! It doesn't seem to be known what is the largest cube inscribed in a regular simplex. Another nice question. | |
| Apr 7, 2015 at 14:25 | comment | added | The Masked Avenger | You might try an upper bound based on inscribing a cube inside a unit simplex. | |
| Apr 7, 2015 at 10:53 | history | asked | Joseph O'Rourke | CC BY-SA 3.0 |