Permutations without long or short cycles

DOI10.1016/J.ENDM.2015.06.023zbMATH Open1346.05007OpenAlexW2174141469MaRDI QIDQ322212FDOQ322212

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

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

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)

Cites Work

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

Cited In (18)

• Local probabilities and total variation distance for random permutations
• Local probabilities for random permutations without long cycles
• Long cycles in \(abc\)-permutations
• Limit theorems for the logarithm of the order of a random \(A\)-mapping
• Universality for random permutations and some other groups
• Separation probabilities for products of permutations
• Title not available (Why is that?)
• Spherically symmetric random permutations
• On products of long cycles: short cycle dependence and separation probabilities
• Asymptotic estimates for the number of permutations without short cycles
• The probability of long cycles in interchange processes
• The cycle structure of random permutations
• On some densities in the set of permutations
• Permutations with Restricted Cycle Structure and an Algorithmic Application
• On mean values of multiplicative functions on the symmetric group
• Arithmetic progressions in permutations
• Cycle structure of the interchange process and representation theory
• 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)