Advanced Optimization Laboratory Title : A d-step approach for distinct squares in strings
Advanced Optimization Laboratory Title : A d-step approach for distinct squares in strings
复制标题
高级优化实验室标题：字符串中不同方块的 d 步方法
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
M. Jiang
中科院分区：
文献类型：
--
作者：
A. Deza;F. Franek;M. Jiang
我们提出了一种解决字符串中不同正方形的最大数目问题的方法，它强调了将长度n和n - d作为关键变量考虑的重要性，其中d是字母表的大小。我们推测了长度为n且包含d个不同符号的字符串有不超过n - d个不同的正方形，证明了满足n = 2d的字符串所起的关键作用，并给出了长度为字母大小的常数倍的字符串所满足的一些性质。
We present an approach to the problem of maximum number of distinct squares in a string which underlines the importance of considering as key variables both the length n and n − d where d is the size of the alphabet. We conjecture that a string of length n and containing d distinct symbols has no more than n − d distinct squares, show the critical role played by strings satisfying n = 2d, and present some properties satisfied by strings of length bounded by a constant times the size of the alphabet.