Additive and multiplicative functions on random permutations
A permutation \(\sigma \in S_n\) has a unique representation as a product of cycles \(\sigma =\kappa _1\dots\kappa _\omega \), and this led V. Goncharov in 1942 to define an analog of the number of prime divisors and to prove the analog of the Erdős-Kac theorem for it. The author considers general additive functions on \(S_n\) which he defines by the requirement \(f(\sigma) = \sum f(\kappa _j)\); such a function is called class dependent if \(f(\kappa)\) depends only on \(l(\kappa)\), the length of the cycle \(\kappa \). Multiplicative functions are defined similarly. In this short paper the author develops the foundations of probabilistic number theory of permutations, including the analogs of the classical theorems of Halász and Kubilius. Most of the results are similar to those of probabilistic number theory, but new phenomena also occur. For example (Theorem 5) the function \(f(\sigma) = \sum l(\kappa _j)^c \) always has a nondegenerate limiting distribution with the proper norming, and for \(c>1\) it has bounded support and so is a fortiori not infinitely divisible.
- Distribution statistique de l'ordre d'un élément du groupe symétrique. (Statistical distribution of the order of an element of the symmetric group)
- scientific article; zbMATH DE number 3978019 (Why is no real title available?)
- scientific article; zbMATH DE number 3670537 (Why is no real title available?)
- scientific article; zbMATH DE number 746087 (Why is no real title available?)
- scientific article; zbMATH DE number 3452922 (Why is no real title available?)
- scientific article; zbMATH DE number 850074 (Why is no real title available?)
- scientific article; zbMATH DE number 3216361 (Why is no real title available?)
- On some problems of a statistical group-theory. I
- Stable limit laws for additive arithmetic functions
- The cyclic structure of random permutations
- Über die Mittelwerte multiplikativer zahlentheoretischer Funktionen
- An analytic method in probabilistic combinatorics
- Asymptotic value distribution of additive functions defined on the symmetric group
- The law of the iterated logarithm for random permutations
- The characteristic polynomial of a random permutation matrix at different points
- The Poisson distribution for linear statistics of random permutations
- The law of iterated logarithm for logarithmic combinatorial assemblies
- The Strassen law of iterated logarithm for combinatorial assemblies
- On statistics of permutations chosen from the Ewens distribution
- Sharp bounds for the variance of linear statistics on random permutations
- Discrete limit laws for additive functions on the symmetric group
- Probabilistic number theory and random permutations: functional limit theory
- scientific article; zbMATH DE number 3989346 (Why is no real title available?)
- scientific article; zbMATH DE number 1959632 (Why is no real title available?)
- Multiplicative functions on \(\mathbb{Z}^n_+\) and the Ewens sampling formula
- On mean values of multiplicative functions on the symmetric group
- On Additive Combinatorics of Permutations of \mathbb{Z}_n
- Summability of additive functions on permutations
- Voronoi summation formulae and multiplicative functions on permutations
- Additive functions on permutations and the Ewens probability
- A limit theorem for additive functions defined on the symmetric group
- Construction of the beta distributions using the random permutation divisors
- Multiplicative arithmetic functions and the generalized Ewens measure
- Involution factorizations of Ewens random permutations
- A stochastic process defined via the random permutation divisors
- Moments of additive functions on random permutations
This page was built for publication: Additive and multiplicative functions on random permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1381648)
