Timeline for Shortest loop through vertices of a convex polytope
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 11 at 16:22 | history | edited | Mohammad Ghomi | CC BY-SA 4.0 |
deleted 2 characters in body
|
| Oct 11 at 16:21 | comment | added | Mohammad Ghomi | @Gerry Myerson: One can think of it that way, subject to a convexity constraint, and maybe computers can be used to verify the conjectured inequality for polytopes with few vertices, which would certainly constitute progress. But ultimately I think it would be more natural to think of the problem in terms of the isoperimetric inequality. | |
| Oct 11 at 15:06 | history | edited | Mohammad Ghomi | CC BY-SA 4.0 |
added 13 characters in body
|
| Oct 11 at 14:40 | history | edited | Mohammad Ghomi | CC BY-SA 4.0 |
added 106 characters in body
|
| Oct 11 at 3:37 | history | edited | Mohammad Ghomi | CC BY-SA 4.0 |
deleted 156 characters in body
|
| Oct 11 at 3:16 | history | edited | Mohammad Ghomi | CC BY-SA 4.0 |
deleted 39 characters in body
|
| Oct 11 at 0:04 | comment | added | Gerry Myerson | Isn't this just the travelling salesman problem in three dimensions? | |
| Oct 10 at 21:09 | history | edited | Mohammad Ghomi | CC BY-SA 4.0 |
deleted 31 characters in body
|
| Oct 10 at 20:22 | history | edited | Mohammad Ghomi | CC BY-SA 4.0 |
edited body
|
| Oct 10 at 20:08 | history | asked | Mohammad Ghomi | CC BY-SA 4.0 |