English

On repetitiveness measures of Thue-Morse words

Data Structures and Algorithms 2020-08-13 v3 Discrete Mathematics

Abstract

We show that the size γ(tn)\gamma(t_n) of the smallest string attractor of the nnth Thue-Morse word tnt_n is 4 for any n4n\geq 4, disproving the conjecture by Mantaci et al. [ICTCS 2019] that it is nn. We also show that δ(tn)=103+24n\delta(t_n) = \frac{10}{3+2^{4-n}} for n3n \geq 3, where δ(w)\delta(w) is the maximum over all k=1,,wk = 1,\ldots,|w|, the number of distinct substrings of length kk in ww divided by kk, which is a measure of repetitiveness recently studied by Kociumaka et al. [LATIN 2020]. Furthermore, we show that the number z(tn)z(t_n) of factors in the self-referencing Lempel-Ziv factorization of tnt_n is exactly 2n2n.

Keywords

Cite

@article{arxiv.2005.09524,
  title  = {On repetitiveness measures of Thue-Morse words},
  author = {Kanaru Kutsukake and Takuya Matsumoto and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda},
  journal= {arXiv preprint arXiv:2005.09524},
  year   = {2020}
}

Comments

accepted to SPIRE 2020