The dual first-order generalized Reed–Muller code 3-design conjecture
Let be a prime power, let be a positive integer, and let be the first-order generalized Reed–Muller code. For , write for the shell of the dual code consisting of codewords of Hamming weight .
Dual Reed–Muller 3-design conjecture. If , then for every , is not a combinatorial -design.
The preceding calculation gives evidence for this claim by expressing the difference of the relevant Jacobi polynomials for two triples as a nonzero multiple of . The conjecture concerns all weight shells of the dual code and remains unresolved in the supplied source.
References
Primary source
Ryosuke Yamaguchi, “Jacobi polynomials for the first-order generalized Reed–Muller codes”, arXiv:2309.01119 (2024).
Progress summary
A published 2024 paper proves that every nonempty dual shell fails to be a three-design for all prime powers at least three.
The conjecture asserts that, for with , no nonempty shell is a combinatorial -design. A 2023 source presented this as an unresolved conjecture.
Known results
- Computational checks covered parameters with (2023).
- The primal shells were proved not to be combinatorial -designs for and , while relevant shells are -designs (2023).
2024 published proof
A Springer paper proves the dual assertion for every nonempty shell. Its Jacobi-polynomial difference factors as a nonzero multiple of , establishing failure of the -design condition; no contrary result or standing objection was found.
Current status (as of August 2026): The conjecture is settled affirmatively by the published 2024 proof for all and all nonempty dual shells.
Sources
Solutions 0
No solutions have been posted yet.