Preperiod conjecture for extensions of subtraction sets of size at most three

From papers

Let AA be a finite subtraction set with A3|A|\leq 3, let S{0,1}αS\in\{0,1\}^{\alpha} be a seed, and write p=Per(A,S)p=\operatorname{Per}(A,S). An integer of the form kp+xkp+x is an extension of AA for every kN+k\in\mathbb{N}_+ and xAx\in A under the condition stated. Preperiod-extension conjecture. If kp+xkp+x is an extension of AA for all kN+k\in\mathbb{N}_+ and xAx\in A, then

PrePer(A,S)=0.\operatorname{PrePer}(A,S)=0.

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 k=1k=1, 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

No solutions have been posted yet.