Permutations with roots
The symmetric group \(S_n\) is by definition the group of all permutations of the set \(\{1,2, \dots,n\}\). Given \(k\in\mathbb{N}\) put \[ S^k_n: = \{\pi\in S_n \mid \text{there exists }\xi\in S_n \text{ such that } \xi^k=\pi\} \quad \text{and} \quad \sigma_k(n): = {|S^k_n |\over n!}. \] The author studies the distribution properties of \(\sigma(n): = \sigma_n(n)\), and proves the following three conclusions: (1) \(\sigma(n)\) is dense on \([0,1]\); (2) there are absolute constants \(C\), \(K\geq 1\) such that \[ {1\over x} \# \{n\in N \mid n\leq x\text{ and } \sigma(n) \geq\varepsilon\}\leq C\left(\log {\log x\over \log K/ \varepsilon} \right)^{-1} \] holds true for \({K\over\sqrt x} \leq\varepsilon\leq 1\); and (3) \[ {1\over x} \sum_{n\leq x} \sigma(n) = {e^{-\gamma} \over \log\log x} \bigl(1+o(1)\bigr), \] where \(\gamma\) is the Euler constant.
- On the number of permutations admitting an mth root
- scientific article; zbMATH DE number 1523258
- 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)
- On permutations of order dividing a given integer
- On the number of mth roots of permutations
- Permutations with p^ lth roots
- Identities from partition of the symmetric group \(S_n\)
- Permutations with orders coprime to a given integer
- Convergence rate for some additive function on random permutations
- scientific article; zbMATH DE number 14021 (Why is no real title available?)
- scientific article; zbMATH DE number 1523258 (Why is no real title available?)
- scientific article; zbMATH DE number 2361509 (Why is no real title available?)
- On the number of permutations admitting an mth root
This page was built for publication: Permutations with roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924945)
