MELLIN TRANSFORMS AND ASYMPTOTICS - DIGITAL SUMS

Citation
P. Flajolet et al., MELLIN TRANSFORMS AND ASYMPTOTICS - DIGITAL SUMS, Theoretical computer science, 123(2), 1994, pp. 291-314
Citations number
32
Categorie Soggetti
Computer Sciences",Mathematics,"Computer Science Theory & Methods
ISSN journal
03043975
Volume
123
Issue
2
Year of publication
1994
Pages
291 - 314
Database
ISI
SICI code
0304-3975(1994)123:2<291:MTAA-D>2.0.ZU;2-W
Abstract
Arithmetic functions related to number representation systems exhibit various periodicity phenomena. For instance, a well-known theorem of D elange expresses the total number of ones in the binary representation s of the first n integers in terms of a periodic fractal function. We show that such periodicity phenomena can be analyzed rather systematic ally using classical tools from analytic number theory, namely the Mel lin-Perron formulae. This approach yields naturally the Fourier series involved in the expansions of a variety of digital sums related to nu mber representation systems.