The number of runs in a string

被引:41
|
作者
Rytter, Wojciech [1 ]
机构
[1] Warsaw Univ, Inst Informat, PL-02097 Warsaw, Poland
关键词
run; string; periodicity;
D O I
10.1016/j.ic.2007.01.007
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A run in a string is a nonextendable (with the same minimal period) periodic segment in a string. The set of runs corresponds to the structure of internal periodicities in a string. Periodicities in strings were extensively studied and are important both in theory and practice (combinatorics of words, pattern-matching, computational biology). Let rho(n) be the maximal number of runs in a string of length n. It has been shown that rho(n) = O(n), the proof was very complicated and the constant coefficient in O(n) has not been given explicitly. We demystify the proof of the linear upper bound for p(n) and propose a new approach to the analysis of runs based on the properties of subperiods: the periods of periodic parts of the runs We show that p(n) <= 3.44 n and there are at most 0.67n runs with periods larger than 87. This supports the conjecture that the number of all runs is smaller than n. We also give a completely new proof of the linear bound and discover several new interesting "periodicity lemmas". (c) 2007 Elsevier Inc. All rights reserved.
引用
收藏
页码:1459 / 1469
页数:11
相关论文
共 50 条
  • [41] Baryon number violation and string topologies
    Sjöstrand, T
    Skands, PZ
    NUCLEAR PHYSICS B, 2003, 659 (1-2) : 243 - 298
  • [43] Interlocking number string and code matrix
    Yee, SR
    COMPUTERS & INDUSTRIAL ENGINEERING, 1996, 31 (3-4) : 929 - 932
  • [44] New string theories and their generation number
    Genish, Arel
    Gepner, Doron
    NUCLEAR PHYSICS B, 2014, 885 : 163 - 179
  • [45] ELECTROWEAK STRING CONFIGURATIONS WITH BARYON NUMBER
    VACHASPATI, T
    FIELD, GB
    PHYSICAL REVIEW LETTERS, 1994, 73 (03) : 373 - 376
  • [46] Interlocking number string and code matrix
    Yee, Soung Ryong
    Computers and Industrial Engineering, 1996, 31 (3-4): : 929 - 932
  • [47] Winding number in string field theory
    Hiroyuki Hata
    Toshiko Kojita
    Journal of High Energy Physics, 2012
  • [48] On the Maximal Number of Cubic Subwords in a String
    Kubica, Marcin
    Radoszewski, Jakub
    Rytter, Wojciech
    Walen, Tomasz
    COMBINATORIAL ALGORITHMS, 2009, 5874 : 345 - 355
  • [49] String Graphs with Precise Number of Intersections
    Chmel, Petr
    Jelinek, Vit
    GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2023, PT I, 2023, 14465 : 78 - 92
  • [50] Winding number in string field theory
    Hata, Hiroyuki
    Kojita, Toshiko
    JOURNAL OF HIGH ENERGY PHYSICS, 2012, (01):