English

The carry propagation of the successor function

Combinatorics 2020-04-30 v2 Formal Languages and Automata Theory Dynamical Systems

Abstract

Given any numeration system, we call carry propagation at a number NN the number of digits that are changed when going from the representation of NN to the one of N+1N+1, and amortized carry propagation the limit of the mean of the carry propagations at the first NN integers, when NN tends to infinity, if this limit exists. In the case of the usual base pp numeration system, it can be shown that the limit indeed exists and is equal to p/(p1)p/(p-1). We recover a similar value for those numeration systems we consider and for which the limit exists. We address the problem of the existence of the amortized carry propagation in non-standard numeration systems of various kinds: abstract numeration systems, rational base numeration systems, greedy numeration systems and beta-numeration. We tackle the problem by three different types of techniques: combinatorial, algebraic, and ergodic. For each kind of numeration systems that we consider, the relevant method allows for establishing sufficient conditions for the existence of the carry propagation and examples show that these conditions are close to being necessary conditions.

Keywords

Cite

@article{arxiv.1907.01464,
  title  = {The carry propagation of the successor function},
  author = {Valérie Berthé and Christiane Frougny and Michel Rigo and Jacques Sakarovitch},
  journal= {arXiv preprint arXiv:1907.01464},
  year   = {2020}
}

Comments

55 pages