Timeline for How to minimize the length of a graph connecting n points in $\mathbb{R}^3$
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 25, 2017 at 11:56 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image link broken; now fixed.
|
| Feb 1, 2012 at 17:23 | comment | added | Gerhard Paseman | For large n, it should be clear that configurations that are contained in an ellipsoid of some eccentricity are nonoptimal, as you can move an extremal point to one closer to the center of mass. If nothing else, you should be able to show e.g. for n > 20 a containing ellipsoid with eccentricity greater than delta_n is nonoptimal. Gerhard "Proof Through Elimination Of Cases" Paseman, 2012.02.01 | |
| Feb 1, 2012 at 15:40 | comment | added | Joseph O'Rourke | @JSE: I certainly have no proof. Therefore, I have changed "will be" to "should be"! | |
| Feb 1, 2012 at 15:40 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
added 24 characters in body
|
| Feb 1, 2012 at 14:39 | comment | added | JSE | The sphere packing problem essentially asks you for a lower bound on max |a_i - a_j| (i.e L_infinty norm) given a lower bound on min |a_i - a_j|. Poster is asking for a lower bound on L_1. It wouldn't be surprising if these were close, but is it obvious? | |
| Jan 30, 2012 at 14:49 | vote | accept | Dorian | ||
| Jan 30, 2012 at 13:13 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
added 51 characters in body
|
| Jan 30, 2012 at 12:40 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |