On the Iterates of Digit Maps
Abstract
Given a base b, a "digit map" is a map f: Z 0 Z 0 of the form f(Σi=0n aibi) = Σi=0n f*(ai), 0 ai b-1 for each i, where f* : \0,1,…, b-1\ Z 0 satisfies f*(0) = 0 and f*(1) = 1. It has been proven for b=10 and f*(m) = m2, and various generalizations thereof, that there are arbitrarily long sequences of consecutive positive integers that end up at 1 under repeated application of f. In this paper, we significantly generalize these results, providing a complete classification of digit maps for which, given any periodic point n, there are arbitrarily long sequences of consecutive positive integers that end up n.
0