The unrestricted classification conjecture for periodic Golay pair compressions

Let (A,B)(A,B) be the (v/2)(v/2)-decomposition of a periodic Golay pair PG(v)\operatorname{PG}(v) with row sums aa and bb. Equivalence is taken in the sense used for these decompositions. Classification conjecture. Then (A,B)(A,B) is equivalent to either

([0,a],[0,b])([0,a],[0,b])

or

([a+b2,ab2],[a+b2,ba2]).\bigl([\frac{a+b}{2},\frac{a-b}{2}],[\frac{a+b}{2},\frac{b-a}{2}]\bigr).

The preceding theorem proves this classification under a restriction on the prime factorization of v/2v/2; the conjecture is that the same conclusion remains valid without that restriction. In particular, the case v=50v=50 motivates the conjecture because exhaustive search found no compression of the additional form suggested by the multiple representations of v/2v/2 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.