Optimal single-track Gray-code conjecture
For every prime integer , there exists a cyclic sequence of length of distinct words such that consecutive words, including and , differ in exactly one coordinate, and every column is a cyclic shift of the first: for each coordinate there is an index such that for every .
References
- Optimal single-track Gray codes from Gray-ordered necklaces — arXiv — Chris Dzoba
Source: arXiv
Progress summary
A new preprint reports computer-checked progress through prime 47, but the conjecture for all primes remains open.
The conjecture asks whether optimal single-track Gray codes exist for every prime dimension. A necklace-cycle construction would imply the desired codes, but no general proof is known.
Known results
- Schwartz and Etzion established the relevant maximum-length bound.
- Etzion's 2007 survey identified the prime case as a central open problem.
- The conjecture was computationally confirmed for every prime .
October 17, 2026 extension through prime
This is claimed progress, not a proof of the general conjecture, and the reported extension has not received independent expert assessment in the retrieved sources.
Current status (as of October 2026): the conjecture is known through prime according to an unverified preprint claim, while the assertion for every prime remains open.
Sources
Solutions 0
No solutions have been posted yet.