Abstract
Let $q$ be a positive integer. Consider an infinite word $\omega=w_0w_1w_2\cdots$ over an alphabet of cardinality $q$. A finite word $u$ is called an arithmetic factor of $\omega$ if $u=w_cw_{c+d}w_{c+2d}\cdots w_{c+(|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 $\lceil\log_q d\rceil$ where $d$ is the least positive integer such that $u$ occurs in $\omega$ 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 $\omega$ among all its arithmetic factors of length $n$.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.