Long cycles in \(abc\)-permutations

DOI10.1007/s11853-008-0017-0zbMath1175.05141OpenAlexW1969067412MaRDI QIDQ1039985

Amanda Redlich, Igor Pak

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

zbMATH Keywords

interval exchange transformationsrandom permutationslong cycle permutation

Mathematics Subject Classification ID

Trees (05C05) Dynamical aspects of measure-preserving transformations (37A05) Combinatorial probability (60C05) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ The alternating BWT: an algorithmic perspective ⋮ On a group theoretic generalization of the Morse-Hedlund theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure of three-interval exchange transformations. II: A combinatorial description of the trajectories
• Échanges d'intervalles et transformations induites
• APPROXIMATIONS IN ERGODIC THEORY
• Structure of three interval exchange transformations. I: An arithmetic study