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 条
  • [1] Abelian Square-Free Partial Words
    Blanchet-Sadri, Francine
    Kim, Jane I.
    Mercas, Robert
    Severa, William
    Simmons, Sean
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2010, 6031 : 94 - +
  • [2] Rich square-free words
    Vesti, Jetro
    THEORETICAL COMPUTER SCIENCE, 2017, 687 : 48 - 61
  • [3] On the number of Abelian square-free words on four letters
    Carpi, A
    DISCRETE APPLIED MATHEMATICS, 1998, 81 (1-3) : 155 - 167
  • [4] Maximal abelian square-free words of short length
    Korn, M
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2003, 102 (01) : 207 - 211
  • [5] Improved bounds on the length of maximal abelian square-free words
    Bullock, EM
    ELECTRONIC JOURNAL OF COMBINATORICS, 2004, 11 (01):
  • [6] ON THE NUMBER OF PARTIALLY ABELIAN SQUARE-FREE WORDS ON A 3-LETTER ALPHABET
    CORI, R
    FORMISANO, MR
    THEORETICAL COMPUTER SCIENCE, 1991, 81 (01) : 147 - 153
  • [7] Problems in between words and abelian words: k-abelian avoidability
    Huova, Mari
    Karhumaki, Juhani
    Saarela, Aleksi
    THEORETICAL COMPUTER SCIENCE, 2012, 454 : 172 - 177
  • [8] Abelian Properties of Words
    Puzynina, Svetlana
    COMBINATORICS ON WORDS, WORDS 2019, 2019, 11682 : 28 - 45
  • [9] ABELIAN PRIMITIVE WORDS
    Domaratzki, Michael
    Rampersad, Narad
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (05) : 1021 - 1033
  • [10] ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS
    Pelantova, Edita
    Starosta, Stepan
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (05) : 1067 - 1083