Line packing in real projective space · n = 18
Choose n lines through the origin of R^d so that the minimum angle between any two is as large as possible — equivalently, minimize the largest coherence μ = max |cos ∠(v_i, v_j)|.
Formal definition
- ContainerReal d-space R^d, every line through the origin; an answer is n points of real projective space RP^{d-1}
- SubmissionExactly n nonzero vectors, d coordinates each; a vector stands for the line it spans
- ObjectiveMinimize μ² = max (v_i·v_j)²/(|v_i|²|v_j|²), compared exactly by cross-multiplication — no normalization, no square roots
- ScoringThe record is ceil(μ²·10¹⁸), rounded against the submitter; the page shows μ, rounded up at the ninth decimal