Discrete derivatives of sequences (Q5956782)

The authors define the discrete derivative of a sequence \(F:\mathbb{N}\to\mathbb{N}\) \((F\) nondecreasing and onto) by \(F'(m):= {1\over \#F^{-1} (F(m))}\). The corresponding integration process consists of reconstructing a sequence \(F\) from the sequence \(\tau(F)= \{\#F^{-1}(k); k\geq 1\}\). These notions are formal reminders of the corresponding continuous notions, and the authors show how to use these analogies to solve discrete problems (e.g., asymptotic behaviour of sequences). A canonical example is given by the Golomb sequence defined by \(\# F^{-1}(k)=F(k)\) and beginning by \[ 1,2,2,3,3,4,4,4, 5,5,5, 6,6,6,6,7,\dots \] [See in particular \textit{Y.-F. S. Pétermann}, J. Number Theory 53, 13-24 (1995; Zbl 0839.11005) and Arch. Math. 67, 473-477 (1996; Zbl 0865.11022); \textit{J.-L. Rémy}, J. Number Theory 66, 1-28 (1997; Zbl 0881.11024); \textit{I. Vardi}, J. Number Theory 40, 1-11 (1992; Zbl 0758.11012); and \textit{Y.-F. S. Petermann}, \textit{J.-L. Rémy} and \textit{I. Vardi}, J. Théor. Nombres Bordx. 11, 211-230 (1999; Zbl 0973.11029)].