一个字符串可以包含多少个双方块?
How many double squares can a string contain?
摘要:
计算正方形的类型,而不是它们的出现,我们考虑的问题的边界的数目不同的正方形在一个字符串。Fraenkel和Simpson在1998年证明了一个长度为n的字符串最多包含2n个不同的正方形。Ilie在2007年提出了2n - Theta(log n)的渐近上界。我们证明了一个长度为n的字符串最多包含5 n/3个不同的正方形。这个新的上界是通过研究双方阵的组合结构得到的,并证明了长度为n的串至多包含2n/3个双方阵.此外,所建立的结构性质为Fraenkel和Simpson的结果提供了新的证明。
英文摘要:
Counting the types of squares rather than their occurrences, we consider the problem of bounding the number of distinct squares in a string. Fraenkel and Simpson showed in 1998 that a string of length n contains at most 2n distinct squares. Ilie presented in 2007 an asymptotic upper bound of 2n - Theta(log n). We show that a string of length n contains at most 5n/3 distinct squares. This new upper bound is obtained by investigating the combinatorial structure of double squares and showing that a string of length n contains at most 2n/3 double squares. In addition, the established structural properties provide a novel proof of Fraenkel and Simpson's result.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。