Permutations with restricted cycle lengths

DOI10.5802/ALCO.449MaRDI QIDQ6906895zbMATH OpenFDO

Authors Miklós Bóna, Boris Pittel

Publication date 4 November 2025

Published in Algebraic Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5802/ALCO.449

zbMATH Keywords

conjugacy classescyclespermutationssorting

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Cites work

• Another proof of the Harer-Zagier formula
• Combinatorics of permutations
• Enumerative Combinatorics
• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 1774199 (Why is no real title available?)
• scientific article; zbMATH DE number 919921 (Why is no real title available?)
• Nombre de représentations d'une permutation comme produit de deux cycles de longueurs données
• Probabilistic Methods in Combinatorial Analysis
• Short proofs for cut-and-paste sorting of permutations
• Sorting a bridge hand
• Sorting by Transpositions
• Sorting permutations by block-interchanges
• Symmetric functions and Hall polynomials. With contributions by A. V. Zelevinsky
• Two enumerative results on cycles of permutations

This page was built for publication: Permutations with restricted cycle lengths

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