Duchêne et al.'s ultimate periodicity conjecture for segment scores

At least 3 years old · documented by

A segment of nn vertices starting with a black vertex is denoted by SnS_n, and a segment starting with a white vertex by S−nS_{-n}. Let Ls(Sn)Ls(S_n) and Rs(Sn)Rs(S_n) denote the left and right scores of the segment game on SnS_n. Duchêne et al.'s conjecture. The sequences Ls(Sn)Ls(S_n) and Rs(Sn)Rs(S_n) are ultimately periodic.

Exact score values are known for some values of nn, but the majority of the scores remain unknown; computations of the first 80 values suggest this periodicity.

References

Primary source

Eric Duchêne, Nacim Oijid and Aline Parreau, “Bipartite instances of INFLUENCE”, arXiv:2206.06118 (2022).

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.