Arithmetic periodicity for Family A cut games

From papers

Let XX be a non-empty set of even numbers, each at least 44, and let YY be a non-empty set of odd numbers, each at least 55. Write x=2cx=2c for the smallest element of XX. Family A consists of cut sets

C={1,3}X\mathcal{C}=\{1,3\}\cup X

or

C={1,3}XY.\mathcal{C}=\{1,3\}\cup X\cup Y.

Family A arithmetic-periodicity conjecture. The nim-sequence for every game of \textsc{cut} in this family is precisely (0,1)c(+2)(0,1)^c (+2). This concerns one of the families whose nim-sequence was described as unknown; proving arithmetic periodicity for Families A and B would imply Conjecture 1 of the cited prior work.

Progress summary

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

Sources & referencesView supporting material

Primary source

Paul Ellis and Thotsaporn Aek Thanatipanonda, “The Arithmetic-Periodicity of cut for C=\1,2c\”, arXiv:2203.02457 (2022).

Solutions 0

No solutions have been posted yet.