Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
{"title":"Long Twins in Random Words","authors":"Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński","doi":"10.1007/s00026-023-00651-5","DOIUrl":null,"url":null,"abstract":"<div><p><i>Twins</i> in a finite word are formed by a pair of identical subwords placed at disjoint sets of positions. We investigate the maximum length of twins in <i>a random</i> word over a <i>k</i>-letter alphabet. The obtained lower bounds for small values of <i>k</i> significantly improve the best estimates known in the deterministic case. Bukh and Zhou in 2016 showed that every ternary word of length <i>n</i> contains twins of length at least 0.34<i>n</i>. Our main result states that in a random ternary word of length <i>n</i>, with high probability, one can find twins of length at least 0.41<i>n</i>. In the general case of alphabets of size <span>\\(k\\geqslant 3\\)</span> we obtain analogous lower bounds of the form <span>\\(\\frac{1.64}{k+1}n\\)</span> which are better than the known deterministic bounds for <span>\\(k\\leqslant 354\\)</span>. In addition, we present similar results for <i>multiple</i> twins in random words.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-023-00651-5.pdf","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-023-00651-5","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 1
Abstract
Twins in a finite word are formed by a pair of identical subwords placed at disjoint sets of positions. We investigate the maximum length of twins in a random word over a k-letter alphabet. The obtained lower bounds for small values of k significantly improve the best estimates known in the deterministic case. Bukh and Zhou in 2016 showed that every ternary word of length n contains twins of length at least 0.34n. Our main result states that in a random ternary word of length n, with high probability, one can find twins of length at least 0.41n. In the general case of alphabets of size \(k\geqslant 3\) we obtain analogous lower bounds of the form \(\frac{1.64}{k+1}n\) which are better than the known deterministic bounds for \(k\leqslant 354\). In addition, we present similar results for multiple twins in random words.
期刊介绍：
Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board.
The scope of Annals of Combinatorics is covered by the following three tracks:
Algebraic Combinatorics:
Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices
Analytic and Algorithmic Combinatorics:
Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms
Graphs and Matroids:
Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
