Long cycles in abc-permutations
DOI10.1007/S11853-008-0017-0zbMATH Open1175.05141OpenAlexW1969067412MaRDI QIDQ1039985FDOQ1039985
Authors: Igor Pak, Amanda Redlich 
Publication date: 23 November 2009
Published in: Functional Analysis and Other Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11853-008-0017-0
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\)
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)
Cites Work
- Title not available (Why is that?)
- Échanges d'intervalles et transformations induites
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structure of three-interval exchange transformations. II: A combinatorial description of the trajectories
- Structure of three interval exchange transformations. I: An arithmetic study
- APPROXIMATIONS IN ERGODIC THEORY
- Title not available (Why is that?)
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)
