P61 · Codebook packing in complex projective space · Discussion

P61 · d = 3, n = 14 · Solver note / 求解记录

邱仲普

Reproducible transfer from the public Game of Sloanes-derived file https://github.com/tretoef-estrella/sloane-coherence-records/blob/main/cell_3x14/3x14_ral.txt . Parse its 84 values as 42 real components followed by 42 imaginary components, grouped into 14 vectors in C^3; round every component to the nearest 1e-9 decimal required by MinMax, and submit the resulting 14x3 complex vectors. Recompute every pairwise normalized Hermitian overlap with exact integer fractions after clearing decimal denominators. The largest squared overlap is 406572674408511350/10^18 (ceil convention), with closest pair 1 and 10. The source file's unrounded value is not submitted; all reported digits above are from the nine-decimal certificate.