On the iterates of digit maps

Abstract: Given a base

b

, a "digit map" is a map

f : m a t h b b Z^{g e 0} o m a t h b b Z^{g e 0}

of the form

f (s u m_{i = 0}^{n} a_{i} b^{i}) = s u m_{i = 0}^{n} f_{*} (a_{i})

,

0 l e a_{i} l e b - 1

for each

i

, where

f_{*} : 0, 1, d o t s, b - 1 o m a t h b b Z^{g e 0}

satisfies

f_{*} (0) = 0

and

f_{*} (1) = 1

. It has been proven for

b = 10

and

f_{*} (m) = m^{2}

, 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

.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: On the iterates of digit maps