Recommendations
- On the Erdős-Turán theorem on the logarithm of the order of a random permutation
- On permutations of order dividing a given integer
- On the probability of coincidence of cycle lengths for independent random permutations with given number of cycles
- How often are two permutations comparable?
- Permutations with orders coprime to a given integer
Cites work
- A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics
- An analogue to Dixon's theorem for automaton groups
- Analytic combinatorics in several variables.
- Applications of the theory of records in the study of random trees
- Estimation problems and randomised group algorithms.
- scientific article; zbMATH DE number 193573 (Why is no real title available?)
- scientific article; zbMATH DE number 1503606 (Why is no real title available?)
- Logarithmic combinatorial structures: A probabilistic approach
- New software for computing asymptotics of multivariate generating functions
- On permutations of order dividing a given integer
- On some problems of a statistical group-theory. III
- On some problems of a statistical group-theory. IV
- Prime Suspects
- The asymptotics of 𝑒^{𝑃(𝑧)} and the number of elements of each order in 𝑆_{𝑛}
- Über die Anzahl der Lösungen von \(x^n=1\) in der symmetrischen Gruppe \(S_n\)
Cited in
(5)
This page was built for publication: Permutations with equal orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886112)
