Preperiod conjecture for extensions of subtraction sets of size at most three
Preperiod conjecture for extensions of subtraction sets of size at most three
Let be a finite subtraction set with , let be a seed, and write . An integer of the form is an extension of for every and under the condition stated. Preperiod-extension conjecture. If is an extension of for all and , then
The statement is the converse of the cited invariant-extension proposition for sets of size at most three. The source notes that it suffices to check , and that the converse is not true for nonempty seeds in the unrestricted setting.
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
István Miklós and Logan Post, “Superpolynomial period lengths of the winning positions in the subtraction game”, arXiv:2312.02426 (2023).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.