On arithmetic index in the generalized Thue-Morse word
Abstract
Let q be a positive integer. Consider an infinite word ω=w0w1w2·s over an alphabet of cardinality q. A finite word u is called an arithmetic factor of ω if u=wcwc+dwc+2d·s wc+(|u|-1)d for some choice of positive integers c and d. We call c the initial number and d the difference of u. For each such u we define its arithmetic index by q d where d is the least positive integer such that u occurs in ω as an arithmetic factor with difference d. 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 ω among all its arithmetic factors of length n.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.