Long cycles in abc-permutations
From MaRDI portal
Trees (05C05) Combinatorial probability (60C05) Dynamical aspects of measure-preserving transformations (37A05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99)
Recommendations
- Permutations without long or short cycles
- Local probabilities for random permutations without long cycles
- Limit theorem for the middle members of ordered cycle lengths in random \(A\)-permutations
- On permutations with cycle lengths in a random set
- On the number of permutations on n objects with greatest cycle length k
Cites work
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1516426 (Why is no real title available?)
- scientific article; zbMATH DE number 1424288 (Why is no real title available?)
- scientific article; zbMATH DE number 3244887 (Why is no real title available?)
- APPROXIMATIONS IN ERGODIC THEORY
- Structure of three interval exchange transformations. I: An arithmetic study
- Structure of three-interval exchange transformations. II: A combinatorial description of the trajectories
- Échanges d'intervalles et transformations induites
Cited in
(5)
This page was built for publication: Long cycles in \(abc\)-permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1039985)