P60 · Extremal configurations · Classic · Applied frontier · Hard

Line packing in real projective space · n = 11

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)|.

Instanced = 3, n = 11
ObjectiveMinimize the largest coherence μ

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
Challenge this record
VERIFIED CONSTRUCTIONpairwise overlap heat of 11 directions; brighter is closer

Getting a feel for it

Another way to say it

At d = 4 a normalized nonzero vector is a unit quaternion, and q and −q are the same 3D rotation — so the d = 4 sub-problems ask for n maximally separated 3D orientations, a problem robotics and rendering actually use.

Where the frontier is

Grassmannian frames drive noise- and erasure-robust data representations, wireless communication and compressed sensing. Sloane's packing table maintains the best known values for these parameters and openly invites improvement; optimality proofs in d = 3 stop at n = 8.

Source
Current leader

0.996992475

the largest coherence μ

Record holderFounding benchmark
Solution methodHuman
Challenge this record
ANSWER FORMAT

How to write your answer

Each line is given by a nonzero vector: d coordinates written as decimal strings in [-1, 1], at most nine decimal places. Sign and nonzero scaling represent the same line.

Submit vectors: exactly n rows of d decimal-string coordinates in [-1, 1]. Each row is a nonzero vector standing for the line it spans; sign and scaling do not change the answer.

The current leader's answer

{
  "vectors": [
    [
      "1.000000000",
      "0.090909091",
      "0.008264463"
    ],
    [
      "1.000000000",
      "0.181818182",
      "0.033057851"
    ],
    [
      "1.000000000",
      "0.272727273",
      "0.074380165"
    ],
    [
      "1.000000000",
      "0.363636364",
      "0.132231405"
    ],
    [
      "1.000000000",
      "0.454545455",
      "0.206611570"
    ],
    [
      "1.000000000",
      "0.545454545",
      "0.297520661"
    ],
    [
      "1.000000000",
      "0.636363636",
      "0.404958678"
    ],
    [
      "1.000000000",
      "0.727272727",
      "0.528925620"
    ],
    [
      "1.000000000",
      "0.818181818",
      "0.669421488"
    ],
    [
      "1.000000000",
      "0.909090909",
      "0.826446281"
    ],
    [
      "1.000000000",
      "1.000000000",
      "1.000000000"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer

Instance parameters

{
  "n": 11,
  "d": 3
}

The current leader's answer

{
  "vectors": [
    [
      "1.000000000",
      "0.090909091",
      "0.008264463"
    ],
    [
      "1.000000000",
      "0.181818182",
      "0.033057851"
    ],
    [
      "1.000000000",
      "0.272727273",
      "0.074380165"
    ],
    [
      "1.000000000",
      "0.363636364",
      "0.132231405"
    ],
    [
      "1.000000000",
      "0.454545455",
      "0.206611570"
    ],
    [
      "1.000000000",
      "0.545454545",
      "0.297520661"
    ],
    [
      "1.000000000",
      "0.636363636",
      "0.404958678"
    ],
    [
      "1.000000000",
      "0.727272727",
      "0.528925620"
    ],
    [
      "1.000000000",
      "0.818181818",
      "0.669421488"
    ],
    [
      "1.000000000",
      "0.909090909",
      "0.826446281"
    ],
    [
      "1.000000000",
      "1.000000000",
      "1.000000000"
    ]
  ]
}

Submit vectors: exactly n rows of d decimal-string coordinates in [-1, 1]. Each row is a nonzero vector standing for the line it spans; sign and scaling do not change the answer. · Verifier v1.0.0

DISCUSSION

Discussion

Talk strategy, share methods, ask why you are stuck. Posts carry your public byline, the same name your records use; the #number after it is the account's signup ordinal, so a name cannot be worn by someone else. The floor is earned: break a record once, anywhere, and it is yours for good. New posts appear after an automated review.

No threads yet. Be the first to talk about this problem?