Timeline for Shortest polygonal chain with $6$ edges visiting all the vertices of a cube
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 16 at 8:05 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 19 at 8:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 19 at 22:42 | comment | added | Gerry Myerson | According to meta.mathoverflow.net/questions/5850/2023-a-year-in-moderation in 2023, $403$ users were destroyed. A footnote says, A "destroyed" user is deleted along with all that they had posted: questions, answers, comments. Generally used as an expedient way of getting rid of spam. A link is given to meta.stackexchange.com/questions/88994/… | |
| Jun 19 at 16:50 | comment | added | Marco Ripà | @GerryMyerson I cannot understand what "destroyed" means in the context. Anyway, a few days later, I received a strange, truncated, email from somebody claiming to be the OP, saying that the user account had been deleted and that he/she was trying to restore it together with the platform (?). Hoping that I haven't replied to a scam email or something like that, pretty strange. I was only interested in the posted answer since it would have solved the problem I shared here. | |
| Jun 19 at 13:01 | comment | added | Gerry Myerson | That user was "destroyed". mathoverflow.net/posts/472634/timeline | |
| Jun 19 at 6:42 | answer | added | Marco Ripà | timeline score: 2 | |
| Jun 6 at 23:37 | comment | added | Max Alekseyev | That answer was deleted by CommunityBot. I'm not sure what was the reason, but it looks like something happened with its author (banned?). I've cast an undelete vote - hope it'll help. | |
| Jun 6 at 8:04 | comment | added | Marco Ripà | What happened? Has the proposed solution posted here been retired or deleted? It has just disappeared... | |
| Jun 4 at 6:43 | comment | added | Marco Ripà | @MaxAlekseyev Yes, it is... for any $k$-dimensional (Euclidean) space, if $k>1$, then the minimum-link poligonal chains have $3 \cdot 2^{k-2}$ edges, as follows by Theorems 2.2 and 2.3 of arxiv.org/pdf/2212.11216 | |
| Jun 4 at 3:20 | comment | added | Max Alekseyev | "a minimum-link polygonal chain visiting all the vertices of a cube consists of 6 (connected) line segments" - is this proved somewhere? | |
| Jun 3 at 20:13 | history | asked | Marco Ripà | CC BY-SA 4.0 |