arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.13576cs.DM
收藏

林登词,三平方引理和原始平方

Lyndon Words, the Three Squares Lemma, and Primitive Squares

Hideo Bannai, Takuya Mieno, Yuto Nakashima

摘要:

我们重新审视所谓的“三个正方形引理”的Crochemore和Rytter [Eschermica 1995],并使用参数的基础上林登的话,得出一个更一般的变种,认为三个重叠的广场不一定有一个共同的前缀。我们还给出了一个改进的上界$n\log_2 n$上的最大数量(出现)连续根广场的长度$n$,也使用参数的基础上林登字。据我们所知,唯一已知的上限是$n \log_ϕn \approx 1.441n\log_2 n$,其中$ϕ$是黄金比例,由Fraenkel和Simpson [TCS 1999]通过三平方引理获得。

英文摘要:

We revisit the so-called "Three Squares Lemma" by Crochemore and Rytter [Algorithmica 1995] and, using arguments based on Lyndon words, derive a more general variant which considers three overlapping squares which do not necessarily share a common prefix. We also give an improved upper bound of $n\log_2 n$ on the maximum number of (occurrences of) primitively rooted squares in a string of length $n$, also using arguments based on Lyndon words. To the best of our knowledge, the only known upper bound was $n \log_ϕn \approx 1.441n\log_2 n$, where $ϕ$ is the golden ratio, reported by Fraenkel and Simpson [TCS 1999] obtained via the Three Squares Lemma.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑