Digital Sums and Divide-and-Conquer Recurrences : Fourier Expansions and Absolute Convergence

@inproceedings{Grabner2002DigitalSA,
  title={Digital Sums and Divide-and-Conquer Recurrences : Fourier Expansions and Absolute Convergence},
  author={Peter J. Grabner and Hsien-Kuei Hwang},
  year={2002}
}
Let ν(n) denote the number of 1’s in the binary representation of n. Properties of this function have been extensively studied in the literature due partly to its natural and frequent appearance in many concrete problems in diverse fields; see [16] and [42] and the references therein. For more examples, see [1], [2], [5], [7], [8], [12], [20], [34]. The well-known Trollope-Delange formula (see [13], [46]) for the sum function of ν(n) has attracted much attention in the literature since it… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 37 references

Exact solution of a minimal recurrence

Inf. Process. Lett. • 2000
View 2 Excerpts

non-dérivabilité de fonctions périodiques associées à certaines formules sommatoires, The mathematics of Paul

G. Tenenbaum, Sur la
1997
View 1 Excerpt

Probabilistic theory of additive functions related to systems of numeration, New trends in Probability and Statistics, Vol

E. Manstavičius
(Palanga, • 1996
View 1 Excerpt

Sommes des chiffres et nombres presque premiers

D. E. Knuth
Math . Ann . • 1996

Similar Papers

Loading similar papers…