Periodicity conjecture for the k-binomial complexity of generalized Thue–Morse words

Let m3m\geq 3, and let tm\mathbf{t}_{m} be the generalized Thue–Morse word. For k3k\geq 3, write btm,k(n)b_{\mathbf{t}_{m},k}(n) for its kk-binomial complexity.

Periodicity conjecture. For every k3k\geq 3, the function btm,k(n)b_{\mathbf{t}_{m},k}(n) is ultimately periodic with period mkm^{k}.

The cases k=1k=1 and k=2k=2 are known to be ultimately periodic with periods mm and m2m^{2}, respectively; the conjecture proposes the analogous period mkm^{k} for every higher binomial complexity.

Sources & referencesView supporting material

Primary source

Xiao-Tao Lü, Jin Chen, Zhi-Xiong Wen and Wen Wu, “On the 2-binomial complexity of the generalized Thue-Morse words”, arXiv:2112.05347 (2021).

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.