Timeline for The minimum of a sum of absolute values of inner products in $\mathbb{R}^d$
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 26, 2017 at 4:48 | comment | added | Christian Remling | In general, minimizing in $\ell^1$ and $\ell^2$ is not the same thing, so it's surprising (to me) that this works so smoothly here. For example, for $d=2$, $n=3$ equally spaced vectors beat the orthogonal configuration for $p=2$. | |
| Jun 26, 2017 at 4:47 | comment | added | Fedor Petrov | Alas, $\sum \langle v_i, v_j\rangle^2$ has different minimizer already for $n=3$, $d=2$. | |
| Jun 26, 2017 at 4:30 | vote | accept | TOM | ||
| Jun 26, 2017 at 4:07 | history | answered | fedja | CC BY-SA 3.0 |