arXiv Analytics

Sign in

arXiv:0907.0880 [math.NT]AbstractReferencesReviewsResources

Equations of the form $t(x+a)=t(x)$ and $t(x+a)=1-t(x)$ for Thue-Morse sequence

Vladimir Shevelev

Published 2009-07-05, updated 2012-10-08Version 7

For every $a\geq1$ we give a recursion algorithm of building of set of solutions of equations of the form $t(x+a)=t(x)$ and $t(x+a)=1-t(x),$ where $\{t(n)\}$ is Thue-Morse sequence. We pose an open problem and two conjectures.

Comments: 14 pages. Adding in proof of Theorem 2 in detail point 5
Categories: math.NT
Subjects: 11B83
Related articles: Most relevant | Search more
arXiv:1603.04434 [math.NT] (Published 2016-03-14)
Two analogs of Thue-Morse sequence
arXiv:1707.05112 [math.NT] (Published 2017-07-17)
Normality of the Thue--Morse sequence along Piatetski-Shapiro sequences
arXiv:1511.01671 [math.NT] (Published 2015-11-05)
Normality of the Thue--Morse sequence along Piatetski-Shapiro sequences, II