Central limit theorem for the least common multiple of a uniformly sampled m-tuple of integers

DOI10.1016/J.JNT.2021.06.012MaRDI QIDQ2064334zbMATH OpenOpenAlexWikidataFDO

Authors Dariusz Buraczewski, Alexander Iksanov, Alexander Marynych

Publication date 5 January 2022

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2004.05643

zbMATH Keywords

Brownian motioncentral limit theoremcoupon collector's problemleast common multiple

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Arithmetic functions in probabilistic number theory (11K65) Central limit and other weak theorems (60F05)

Abstract: Let $B_n(m)$ be a set picked uniformly at random among all $m$-elements subsets of $1,2,ldots,n$. We provide a pathwise construction of the collection $(B_n(m){)}_{1leqmleqn}$ and prove that the logarithm of the least common multiple of the integers in $(B_n(lfloormtfloor){)}_{tgeq0}$, properly centered and normalized, converges to a Brownian motion when both $m,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 $m$ independent random variables having uniform distribution on $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.

Recommendations

• Limit theorems for the least common multiple of a random set of integers
• On the least common multiple of several random integers
• The least common multiple of random sets of positive integers
• On the least common multiple of random \(q\)-integers
• On the least common multiple of shifted powers

Cites work

• A generalization of the Erdős-Turán law for the order of random permutation
• Divisibility properties of random samples of integers
• Foundations of Modern Probability
• scientific article; zbMATH DE number 43570 (Why is no real title available?)
• scientific article; zbMATH DE number 3216361 (Why is no real title available?)
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• Limit Theorems for Combinatorial Structures via Discrete Process Approximations
• Limit theorems for the least common multiple of a random set of integers
• Logarithmic combinatorial structures: A probabilistic approach
• On some problems of a statistical group-theory. III
• On the Amount of Dependence in the Prime Factorization of a Uniform Random Integer
• On the average value of the least common multiple of \(k\) positive integers
• On the l.c.m. of random terms of binary recurrence sequences
• On the least common multiple of several random integers
• The least common multiple of random sets of positive integers
• The order of large random permutations with cycle weights
• The probability theory of additive arithmetic functions

Cited in

(1)

• Limit theorems for the least common multiple of a random set of integers

This page was built for publication: Central limit theorem for the least common multiple of a uniformly sampled \(m\)-tuple of integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064334)