Periodicity conjecture for the k-binomial complexity of generalized Thue–Morse words
Periodicity conjecture for the k-binomial complexity of generalized Thue–Morse words
Let , and let be the generalized Thue–Morse word. For , write for its -binomial complexity.
Periodicity conjecture. For every , the function is ultimately periodic with period .
The cases and are known to be ultimately periodic with periods and , respectively; the conjecture proposes the analogous period 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.