The unrestricted classification conjecture for periodic Golay pair compressions
The unrestricted classification conjecture for periodic Golay pair compressions
Let be the -decomposition of a periodic Golay pair with row sums and . Equivalence is taken in the sense used for these decompositions. Classification conjecture. Then is equivalent to either
or
The preceding theorem proves this classification under a restriction on the prime factorization of ; the conjecture is that the same conclusion remains valid without that restriction. In particular, the case motivates the conjecture because exhaustive search found no compression of the additional form suggested by the multiple representations of as a sum of two squares.
Sources & referencesView supporting material
Primary source
Tyler Lumsden, Ilias Kotsireas and Curtis Bright, “New Results on Periodic Golay Pairs”, arXiv:2408.15611 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.