Multiplicative arithmetic functions and the generalized Ewens measure

DOI10.1007/S11856-024-2609-XarXiv1909.00601MaRDI QIDQ6324540FDOQ6324540

Authors: Dor Elboim, Ofir Gorodetsky 

Publication date: 2 September 2019

Abstract: Random integers, sampled uniformly from $[1,x]$, share similarities with random permutations, sampled uniformly from $S_n$. These similarities include the ErdH{o}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 $alphacolonmathbbNomathbb{R}_{ge0}$, one may associate with it a measure on the integers in $[1,x]$, where $n$ is sampled with probability proportional to the value $alpha(n)$. Analogously, given a sequence ${het{a}_i}_{ige1}$ of non-negative reals, one may associate with it a measure on $S_n$ 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 $alpha$ over primes tends to some positive $heta$, as well as the weights $alpha(p)approx(logp{)}^{gamma}$. In both cases, we obtain results in the integer setting which are in agreement with those in the permutation setting.

This page was built for publication: Multiplicative arithmetic functions and the generalized Ewens measure

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