{"title":"Convergence of the Number of Period sets in Strings","authors":"Eric Rivals, Michelle Sweering, 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.
期刊介绍:
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.