The unrestricted classification conjecture for periodic Golay pair compressions
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.