On the Iterates of Digit Maps

preprint2020arXivOpen access

Abstract

Given a base bb, a "digit map" is a map f:Z≥0→Z≥0f: \mathbb{Z}^{\ge 0} \to \mathbb{Z}^{\ge 0} of the form f(∑i=0naibi)=∑i=0nf∗(ai)f(\sum_{i=0}^n a_ib^i) = \sum_{i=0}^n f_*(a_i), 0≤ai≤b−10 \le a_i \le b-1 for each ii, where f∗:{0,1,…,b−1}→Z≥0f_* : \{0,1,\dots, b-1\} \to \mathbb{Z}^{\ge 0} satisfies f∗(0)=0f_*(0) = 0 and f∗(1)=1f_*(1) = 1. It has been proven for b=10b=10 and f∗(m)=m2f_*(m) = m^2, and various generalizations thereof, that there are arbitrarily long sequences of consecutive positive integers that end up at 11 under repeated application of ff. In this paper, we significantly generalize these results, providing a complete classification of digit maps for which, given any periodic point nn, there are arbitrarily long sequences of consecutive positive integers that end up nn.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.