Multiplicative arithmetic functions and the generalized Ewens measure
arXiv:1909.00601 · doi:10.1007/s11856-024-2609-x
Abstract
Random integers, sampled uniformly from , share similarities with random permutations, sampled uniformly from . These similarities include the Erdős--Kac theorem on the distribution of the number of prime factors of a random integer, and Billingsley's theorem on the largest prime factors of a random integer. In this paper we extend this analogy to non-uniform distributions. Given a multiplicative function , one may associate with it a measure on the integers in , where is sampled with probability proportional to the value . Analogously, given a sequence of non-negative reals, one may associate with it a measure on that assigns to a permutation a probability proportional to a product of weights over the cycles of the permutation. This measure is known as the generalized Ewens measure. We study the case where the mean value of over primes tends to some positive , as well as the weights . In both cases, we obtain results in the integer setting which are in agreement with those in the permutation setting.
arXiv comment29 pages. Journal version
References in corpus (8)
- Spatial random permutations and infinite cycles
- Random permutations with cycle weights
- Spatial random permutations with small cycle weights
- Cycle structure of random permutations with cycle weights
- Permutations fixing a k-set
- On the number of cycles in a random permutation
- Invariable generation of the symmetric group
- Beyond the LSD method for the partial sums of multiplicative functions