On two classes of permutations with number-theoretic conditions on the lengths of the cycles

DOI10.1007/BF02355462zbMath0917.05007MaRDI QIDQ1277496

A. I. Pavlov

Publication date: 2 August 1999

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

permutationsMöbius functionasymptoticsarithmetic progressionsEuler gamma function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (9)

Moment characteristics of a random mapping with restrictions on component sizes ⋮ Variance of the number of cycles of random \(A\)-permutation ⋮ Power maps in finite groups ⋮ Random mappings with constraints on the cycle lengths ⋮ Limit theorems for the logarithm of the order of a random \(A\)-mapping ⋮ Asymptotics with remainder term for moments of the total cycle number of random \(A\)-permutation ⋮ A limit theorem for the logarithm of the order of a random A-permutation ⋮ On a Number of Components in a Random $A$-Mapping ⋮ On the number of components of fixed size in a random \(A\)-mapping

Cites Work

• Asymptotic Methods in Enumeration
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On two classes of permutations with number-theoretic conditions on the lengths of the cycles