Proof of a conjecture of Krawchuk and Rampersad

arxiv（2023）

引用 0|浏览4

暂无评分

摘要

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 $\mathbf{t}$, up to cyclic rotation.

查看译文

关键词

conjecture,krawchuk

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要