On Ramanujan's Q-function - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

On Ramanujan's Q-function

Philippe Flajolet
  • Function : Author
  • PersonId : 829512
P.J. Grabner
  • Function : Author
P. Kirschenhofer
  • Function : Author
H. Prodinger
  • Function : Author

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1760.pdf (570.3 Ko) Télécharger le fichier

Dates and versions

inria-00077000 , version 1 (29-05-2006)

Identifiers

  • HAL Id : inria-00077000 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More