On random permutations without cycles of some lengths

DOI10.1023/A:1015288321931zbMath0980.60015OpenAlexW1688580905MaRDI QIDQ5948332

Eugenijus Manstavicius

Publication date: 5 November 2001

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015288321931

zbMATH Keywords

sieve method

Mathematics Subject Classification ID

Asymptotic results on counting functions for algebraic and topological structures (11N45) Combinatorial probability (60C05) Probabilistic methods in group theory (20P05) Sieves (11N35)

Related Items (8)

Limit theorems for the logarithm of the order of a random \(A\)-mapping ⋮ On mean values of multiplicative functions on the symmetric group ⋮ A limit theorem for the logarithm of the order of a random A-permutation ⋮ On the number of \(A\)-mappings ⋮ Asymptotic value distribution of additive functions defined on the symmetric group ⋮ Most permutations power to a cycle of small prime length ⋮ On a Number of Components in a Random $A$-Mapping ⋮ On the number of components of fixed size in a random \(A\)-mapping

This page was built for publication: On random permutations without cycles of some lengths