Lengyel's period conjecture for two transfer games
Let be the vector subtraction game with move set
where and . A period means that the game's pattern repeats under translation by and .
Lengyel's conjecture. (a) If is odd and at least , then has period . (b) For , has period .
These claims extend Lengyel's proved special cases for periods of vector subtraction games. The parser supplies no evidence that either assertion has been resolved, so they remain open.
References
- Alon Danai, Paul Ellis and Thotsaporn Aek Thanatipanonda, “Two Dimensional Subtraction – Transfer Games”, arXiv:2602.14325 (2026).
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.