论文信息 - Proof of a conjecture of Krawchuk and Rampersad - 字舞流文

Proof of a conjecture of Krawchuk and Rampersad

We prove a 2018 conjecture of Krawchuk and Rampersad on the extremal behavior of c ( n ), where c ( n ) counts the number of length- n factors of the Thue-Morse word t , up to cyclic rotation.

[1] J. Shallit. The Logical Approach to Automatic Sequences , 2022 .

[2] S. Finch. The On-Line Encyclopedia of Integer Sequences , 2021, The Mathematical Intelligencer.

[3] Narad Rampersad,et al. Cyclic Complexity of Some Infinite Words and Generalizations , 2018, Integers.

[4] Hamoon Mousavi,et al. Automatic Theorem Proving in Walnut , 2016, ArXiv.

[5] Jeffrey Shallit,et al. Subword Complexity and k-Synchronization , 2012, Developments in Language Theory.

[6] Jeffrey Shallit,et al. The Ubiquitous Prouhet-Thue-Morse Sequence , 1998, SETA.

[7] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[8] Cristiano Maggi. ON SYNCHRONIZED SEQUENCES , 2022 .