Agrawal's conjecture on extremal triple arrays
Let , , and be parameters of a symmetric -design on points, and suppose that .
Agrawal's conjecture. If there is a symmetric - design with , then there is an -triple array.
This conjecture asks whether Agrawal's construction from a symmetric design can always be completed from an unordered triple array to an ordered one under the stated condition. It remains open.
References
Primary source
Alexey Gordeev and Lars-Daniel Öhman, “Resolvable Triple Arrays”, arXiv:2512.08681 (2026).
Additional references
2 papers in this index state this conjecture (2016–2025). The statement above is taken from the most recent of them; the others are arXiv:1609.00152.
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
No solutions have been posted yet.