Periodicity conjecture for KAYLESn⊞(∗1)KAYLES_n\boxplus(*1)

At least 7 years old · documented by

Let KAYLESnKAYLES_n denote the Kayles graph game on a path of edge-length nn, and let ⊞\boxplus denote the selective compound operation used in the paper; write ∗1*1 for the one-point Nim game. Kayles selective-compound periodicity conjecture. The sequence KAYLESn⊞(∗1)KAYLES_n\boxplus(*1) is periodic in nn. This is presented as a related direction beyond the periodicity results currently obtained by the threshold theorem and computational verification.

References

Primary source

Calvin Beideman, Matthew Bowen and Necati Alp Muyesser, “The Sprague-Grundy function for some selective compound games”, arXiv:1802.08700 (2018).

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.