Abelian-square-rich words

被引:5
|
作者
Fici, Gabriele [1 ]
Mignosi, Filippo [2 ]
Shallit, Jeffrey [3 ]
机构
[1] Univ Palermo, Dipartimento Matemat & Informat, Palermo, Italy
[2] Univ Aquila, Dipartimento Ingn & Sci Informaz & Matemat, Laquila, Italy
[3] Univ Waterloo, Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
关键词
Abelian square; Thue-Morse word; Sturmian word; MAXIMUM NUMBER; ENUMERATION; COMPLEXITY;
D O I
10.1016/j.tcs.2017.02.012
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain at most Theta(n(2)) distinct factors, and there exist words of length n containing Theta(n(2)) distinct abelian-square factors, that is, distinct factors that are abelian squares. This motivates us to study infinite words such that the number of distinct abelian-square factors of length n grows quadratically with n. More precisely, we say that an infinite word w is abelian-square-rich if, for every n, every factor of w of length n contains, on average, a number of distinct abelian-square factors that is quadratic in n; and uniformly abelian-square-rich if every factor of w contains a number of distinct abelian-square factors that is proportional to the square of its length. Of course, if a word is uniformly abelian-square-rich, then it is abelian-square-rich, but we show that the converse is not true in general. We prove that the Thue-Morse word is uniformly abeliansquare-rich and that the function counting the number of distinct abelian-square factors of length 2n of the Thue-Morse word is 2-regular. As for Sturmian words, we prove that a Sturmian word s alpha of angle alpha is uniformly abelian-square-rich if and only if the irrational alpha has bounded partial quotients, that is, if and only if s alpha has bounded exponent. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:29 / 42
页数:14
相关论文
共 50 条
  • [21] Abelian antipowers in infinite words
    Fici, Gabriele
    Postic, Mickael
    Silva, Manuel
    ADVANCES IN APPLIED MATHEMATICS, 2019, 108 : 67 - 78
  • [22] AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
    Cassaigne, Julien
    Richomme, Gwenael
    Saari, Kalle
    Zamboni, Luca Q.
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2011, 22 (04) : 905 - 920
  • [23] A non-Abelian square root of Abelian vertex operators
    Frieler, K
    Rehren, KH
    JOURNAL OF MATHEMATICAL PHYSICS, 1998, 39 (06) : 3073 - 3090
  • [24] A note on abelian returns in rotation words
    Rampersad, Narad
    Rigo, Michel
    Salimov, Pavel
    THEORETICAL COMPUTER SCIENCE, 2014, 528 : 101 - 107
  • [25] Weak Abelian Periodicity of Infinite Words
    Avgustinovich, Sergey
    Puzynina, Svetlana
    THEORY OF COMPUTING SYSTEMS, 2016, 59 (02) : 161 - 179
  • [26] Words with the Maximum Number of Abelian Squares
    Fici, Gabriele
    Mignosi, Filippo
    COMBINATORICS ON WORDS, WORDS 2015, 2015, 9304 : 122 - 134
  • [27] Some Properties of Abelian Return Words
    Rigo, M.
    Salimov, P.
    Vandomme, E.
    JOURNAL OF INTEGER SEQUENCES, 2013, 16 (02)
  • [28] Algorithms for computing Abelian periods of words
    Fici, Gabriele
    Lecroq, Thierry
    Lefebvre, Arnaud
    Prieur-Gaston, Elise
    DISCRETE APPLIED MATHEMATICS, 2014, 163 : 287 - 297
  • [29] Abelian closures of infinite binary words
    Puzynina, Svetlana
    Whiteland, Markus A.
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2022, 185
  • [30] Abelian powers and repetitions in Sturmian words
    Fici, Gabriele
    Langiu, Alessio
    Lecroq, Thierry
    Lefebvre, Arnaud
    Mignosi, Filippo
    Peltomaki, Jarkko
    Prieur-Gaston, Elise
    THEORETICAL COMPUTER SCIENCE, 2016, 635 : 16 - 34