Eventual periodicity for finite taking-no-breaking octal games under the disjunctive sum

Let O=(n1n2nt,p1p2pt)O=(n_1n_2\dots n_t,p_1p_2\dots p_t) and P=(m1m2ml,q1q2ql)P=(m_1m_2\dots m_l,q_1q_2\dots q_l) be two finite taking-no-breaking octal games. Assume that at least one nsn_s is neither 00 nor 11, and that whenever nin_i and mjm_j equal 11, 22, or 33, the corresponding scores satisfy pi=ip_i=i and qj=jq_j=j, while otherwise pi=qj=0p_i=q_j=0. Let kk be the largest entry in OO such that nk0,1n_k\neq 0,1.

Disjunctive-sum periodicity conjecture. For every mm, there exists NN such that

Gs(n+2k+m)=Gs(n+m)\mathcal{G}_s(n+2k+_{\ell}m)=\mathcal{G}_s(n+_{\ell}m)

for all nNn\geq N.

The conjecture was previously stated with substantial supporting evidence, and the paper studies whether the same periodic behavior persists for the other operators.

Sources & referencesView supporting material

Primary source

Fraser Stewart, “Scoring Play Combinatorial Games Under Different Operators”, arXiv:1202.4656 (2012).

Additional references

2 papers in this index state this conjecture (2012). The statement above is taken from the most recent of them; the others are arXiv:1202.4655.

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.