Timeline for Shortest path connecting two opposite points on a cube
Current License: CC BY-SA 3.0
7 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/
|
|
| Mar 17, 2017 at 19:53 | comment | added | Włodzimierz Holsztyński | The mathematics was clear (of the question and of Anton's answer--I believe). It was hard only (so-to-speak) linguistically. The English was fine but the style was, well, next to impossible :-), | |
| Mar 17, 2017 at 18:05 | comment | added | Gro-Tsen | I meant the smallest possible distance between two antipodal points. Fixed. | |
| Mar 17, 2017 at 18:04 | history | edited | Gro-Tsen | CC BY-SA 3.0 |
clarify statement as per TonyK's comment
|
| Mar 17, 2017 at 15:42 | comment | added | TonyK | You say "clearly it is at most 2", which is surely false if $d \ge 3$. | |
| Mar 17, 2017 at 14:49 | history | edited | Gro-Tsen | CC BY-SA 3.0 |
add an illustration showing the "puffy cube" set $P$ in dimension $2$
|
| Mar 17, 2017 at 14:12 | history | answered | Gro-Tsen | CC BY-SA 3.0 |