A Brownian weak limit for the least common multiple of a random m-tuple of integers

preprint2020arXivOpen access

Abstract

Let Bn(m)B_n(m) be a set picked uniformly at random among all mm-elements subsets of {1,2,…,n}\{1,2,\ldots,n\}. We provide a pathwise construction of the collection (Bn(m))1≤m≤n(B_n(m))_{1\leq m\leq n} and prove that the logarithm of the least common multiple of the integers in (Bn(⌊mt⌋))t≥0(B_n(\lfloor mt\rfloor))_{t\geq 0}, properly centered and normalized, converges to a Brownian motion when both m,nm,n tend to infinity. Our approach consists of two steps. First, we show that the aforementioned result is a consequence of a multidimensional central limit theorem for the logarithm of the least common multiple of mm independent random variables having uniform distribution on {1,2,…,n}\{1,2,\ldots,n\}. Second, we offer a novel approximation of the least common multiple of a random sample by the product of the elements of the sample with neglected multiplicities in their prime decompositions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.