2014/01/08 by Richard Arratia, Arratia, Richard, Fred Kochman +3
Mathematics · #FOS: Mathematics #Probability (math.PR) #math.PR
paper · pdf · doi:10.48550/arxiv.1401.1555
25 pages
arxiv created 2014/01/08 · arxiv updated 2014/01/09
Let p1 ≥ p2 ≥ … be the prime factors of a random integer chosen uniformly from 1 to n, and let (log p1)/(log n), (log p2)/(log n), … be the sequence of scaled log factors. Billingsley's Theorem (1972), in its modern formulation, asserts that the limiting process, as n → ∞, is the Poisson-Dirichlet process with parameter θ=1. In this paper we give a new proof, inspired by the 1993 proof by Donnelly and Grimmett, and extend the result to factorizations of elements of normed arithmetic semigroups satisfying certain growth conditions, for which the limiting Poisson-Dirichlet process need not have θ=1. We also establish Poisson-Dirichlet limits, with θ≠ 1, for ordinary integers conditional on the number of prime factors deviating from the usual value log log n. At the core of our argument is a purely probabilistic lemma giving a new criterion for convergence in distribution to a Poisson-Dirichlet process, from which the number-theoretic applications follow as straightforward corollaries. The lemma uses ingredients similar to those employed by Donnelly and Grimmett, but reorganized so as to allow subsequent number theory input to be processed as rapidly as possible. A by-product of this work is a new characterization of Poisson-Dirichlet processes in terms of multi-intensities.