English

On arithmetic index in the generalized Thue-Morse word

Combinatorics 2018-11-12 v1

Abstract

Let qq be a positive integer. Consider an infinite word ω=w0w1w2\omega=w_0w_1w_2\cdots over an alphabet of cardinality qq. A finite word uu is called an arithmetic factor of ω\omega if u=wcwc+dwc+2dwc+(u1)du=w_cw_{c+d}w_{c+2d}\cdots w_{c+(|u|-1)d} for some choice of positive integers cc and dd. We call cc the initial number and dd the difference of uu. For each such uu we define its arithmetic index by logqd\lceil\log_q d\rceil where dd is the least positive integer such that uu occurs in ω\omega as an arithmetic factor with difference dd. In this paper we study the rate of growth of the arithmetic index of arithmetic factors of a generalization of the Thue-Morse word defined over an alphabet of prime cardinality. More precisely, we obtain upper and lower bounds for the maximum value of the arithmetic index in ω\omega among all its arithmetic factors of length nn.

Keywords

Cite

@article{arxiv.1811.03884,
  title  = {On arithmetic index in the generalized Thue-Morse word},
  author = {Olga Parshina},
  journal= {arXiv preprint arXiv:1811.03884},
  year   = {2018}
}
R2 v1 2026-06-23T05:10:14.269Z