Permutations without long or short cycles

DOI10.1016/J.ENDM.2015.06.023MaRDI QIDQ322212zbMATHOpenAlexFDO

Authors Robertas Petuchovas, Eugenijus Manstavičius

Publication date 14 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.06.023

zbMATH Keywords

symmetric grouptotal variation distancerandom permutationcyclic structurelocal probabilities

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Symmetric groups (20B30)

Recommendations

• Asymptotic estimates for the number of permutations without short cycles
• Local probabilities for random permutations without long cycles
• Local probabilities and total variation distance for random permutations
• The cycle structure of random permutations
• On some densities in the set of permutations

Cites work

• scientific article; zbMATH DE number 176701 (Why is no real title available?)
• scientific article; zbMATH DE number 1305371 (Why is no real title available?)
• scientific article; zbMATH DE number 473229 (Why is no real title available?)
• scientific article; zbMATH DE number 691483 (Why is no real title available?)
• Arithmetical semigroups. II: Sieving by large and small prime elements. Sets of multiples
• Asymptotic expansions for the coefficients of analytic functions
• Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
• Asymptotics of combinatorial structures with large smallest component
• Cycle lengths in a permutation are typically Poisson
• Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes
• Involutions and their progenies
• Largest component in random combinatorial structures
• Logarithmic combinatorial structures: A probabilistic approach
• On the field of combinatory analysis
• Polynomials over finite fields free from large and small degree irreducible factors
• Random permutations with cycle lengths in a given finite set
• Remarks on the semigroup elements free of large prime factors
• Smooth numbers: computational number theory and beyond
• The cycle structure of random permutations

Cited in

(19)

• Universality for random permutations and some other groups
• Local probabilities for random permutations without long cycles
• Separation probabilities for products of permutations
• Spherically symmetric random permutations
• Local probabilities and total variation distance for random permutations
• Permutations with Restricted Cycle Structure and an Algorithmic Application
• The probability of long cycles in interchange processes
• On some densities in the set of permutations
• On products of long cycles: short cycle dependence and separation probabilities
• scientific article; zbMATH DE number 714475 (Why is no real title available?)
• Long cycles in \(abc\)-permutations
• Asymptotic estimates for the number of permutations without short cycles
• Recent results on permutations without short cycles
• Arithmetic progressions in permutations
• Limit theorems for the logarithm of the order of a random \(A\)-mapping
• The cycle structure of random permutations
• Cycle structure of the interchange process and representation theory
• On mean values of multiplicative functions on the symmetric group
• The number of cycles in random permutations without long cycles is asymptotically Gaussian

This page was built for publication: Permutations without long or short cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322212)