Convergence of the Number of Period sets in Strings

IF 0.9 4区 计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Eric Rivals, Michelle Sweering, Pengfei Wang
{"title":"Convergence of the Number of Period sets in Strings","authors":"Eric Rivals,&nbsp;Michelle Sweering,&nbsp;Pengfei Wang","doi":"10.1007/s00453-025-01295-y","DOIUrl":null,"url":null,"abstract":"<div><p>Consider words of length <i>n</i>. The set of all periods of a word of length <i>n</i> is a subset of <span>\\(\\{0,1,2,\\ldots ,n-1\\}\\)</span>. However, not every subset of <span>\\(\\{0,1,2,\\ldots ,n-1\\}\\)</span> can be a valid set of periods. In a seminal paper in 1981, Guibas and Odlyzko proposed encoding the set of periods of a word into a binary string of length <i>n</i>, called an autocorrelation, where a 1 at position <i>i</i> denotes the period <i>i</i>. They considered the question of recognizing a valid period set, and also studied the number <span>\\(\\kappa _n\\)</span> of valid period sets for strings of length <i>n</i>. They conjectured that <span>\\(\\ln \\kappa _n\\)</span> asymptotically converges to a constant times <span>\\((\\ln n)^2\\)</span>. Although improved lower bounds for <span>\\(\\ln \\kappa _n/(\\ln n)^2\\)</span> were proved in 2001, the question of a tight upper bound has remained open since Guibas and Odlyzko’s paper. Here, we exhibit an upper bound for this fraction, which implies its convergence and closes this longstanding conjecture. Moreover, we extend our result to find similar bounds for the number of correlations: a generalization of autocorrelations that encodes the overlaps between two strings.\n</p></div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"87 5","pages":"690 - 711"},"PeriodicalIF":0.9000,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algorithmica","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s00453-025-01295-y","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Consider words of length n. The set of all periods of a word of length n is a subset of \(\{0,1,2,\ldots ,n-1\}\). However, not every subset of \(\{0,1,2,\ldots ,n-1\}\) can be a valid set of periods. In a seminal paper in 1981, Guibas and Odlyzko proposed encoding the set of periods of a word into a binary string of length n, called an autocorrelation, where a 1 at position i denotes the period i. They considered the question of recognizing a valid period set, and also studied the number \(\kappa _n\) of valid period sets for strings of length n. They conjectured that \(\ln \kappa _n\) asymptotically converges to a constant times \((\ln n)^2\). Although improved lower bounds for \(\ln \kappa _n/(\ln n)^2\) were proved in 2001, the question of a tight upper bound has remained open since Guibas and Odlyzko’s paper. Here, we exhibit an upper bound for this fraction, which implies its convergence and closes this longstanding conjecture. Moreover, we extend our result to find similar bounds for the number of correlations: a generalization of autocorrelations that encodes the overlaps between two strings.

字符串中周期集合数目的收敛性
考虑长度为n的单词。长度为n的单词的所有周期的集合是\(\{0,1,2,\ldots ,n-1\}\)的一个子集。但是,并不是\(\{0,1,2,\ldots ,n-1\}\)的每个子集都可以是有效的周期集合。在1981年的一篇重要论文中,gu和Odlyzko提出将一个单词的周期集合编码为长度为n的二进制字符串,称为自相关,其中位置i上的1表示周期i。他们考虑了有效周期集的识别问题,并研究了长度为n的字符串的有效周期集的数量\(\kappa _n\)。他们推测\(\ln \kappa _n\)渐进地收敛于一个常数乘以\((\ln n)^2\)。虽然改进了\(\ln \kappa _n/(\ln n)^2\)的下界在2001年得到了证明,但紧上界的问题自gu和Odlyzko的论文以来一直没有得到解决。在这里,我们展示了这个分数的上界,这意味着它的收敛性,并关闭了这个长期存在的猜想。此外,我们扩展了我们的结果,以找到相似的相关性数量界限:对两个字符串之间的重叠进行编码的自相关性的泛化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Algorithmica
Algorithmica 工程技术-计算机:软件工程
CiteScore
2.80
自引率
9.10%
发文量
158
审稿时长
12 months
期刊介绍: Algorithmica is an international journal which publishes theoretical papers on algorithms that address problems arising in practical areas, and experimental papers of general appeal for practical importance or techniques. The development of algorithms is an integral part of computer science. The increasing complexity and scope of computer applications makes the design of efficient algorithms essential. Algorithmica covers algorithms in applied areas such as: VLSI, distributed computing, parallel processing, automated design, robotics, graphics, data base design, software tools, as well as algorithms in fundamental areas such as sorting, searching, data structures, computational geometry, and linear programming. In addition, the journal features two special sections: Application Experience, presenting findings obtained from applications of theoretical results to practical situations, and Problems, offering short papers presenting problems on selected topics of computer science.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信