On Ramanujan's Q-function

Abstract : This study provides a detailed analysis of a function which Knuth discovered to play a central role in the analysis of hashing with linear probing. The function, named after Knuth Q(n), is related to several of Ramanujan's investigations. It surfaces in the analysis of a variety of algorithms ans discrete probability problems including hashing, the birthday paradox, random mapping statistics, the "rho" method for integer factorization, union-find algorithms, optimum caching, and the study of memory conflicts. A process related to the complex asymptotic methods of singularity analysis and saddle point integrals permits to precisely quantify the behaviour of the Q(n) function. in this way, tight bounds are derived. They answer a question of Knuth (the art of Computer Programming, vol. 1, 1968), itself a rephrasing of earlier questions of Ramanujan in 1911-1913.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00077000
Contributor : Rapport de Recherche Inria <>
Submitted on : Monday, May 29, 2006 - 11:48:49 AM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Friday, May 13, 2011 - 10:28:08 PM

Identifiers

  • HAL Id : inria-00077000, version 1

Collections

Citation

Philippe Flajolet, P.J. Grabner, P. Kirschenhofer, H. Prodinger. On Ramanujan's Q-function. [Research Report] RR-1760, INRIA. 1992. ⟨inria-00077000⟩

Share

Metrics

Record views

143

Files downloads

74