Decomposing a Permutation into Two Large Cycles: An Enumeration
From MaRDI portal
Publication:3964571
DOI10.1137/0601050zbMATH Open0499.05003OpenAlexW2046983574MaRDI QIDQ3964571FDOQ3964571
Publication date: 1980
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0601050
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Theory of matrix inversion and generalized inverses (15A09) Combinatorial identities, bijective combinatorics (05A19) Permutation groups (20B99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- How many ways can a permutation be factored into two n-cycles?
- Even permutations as a product of two conjugate cycles
- Title not available (Why is that?)
- Décompositions d'une permutation d'un ensemble fini en produit de deux cycles
- The product of two reflection classes of the symmetric group
- Some coefficients in the center of the group algebra of the symmetric group
Cited In (13)
- Cycle type factorizations in \(\mathrm{GL}_n \mathbb{F}_q\)
- The reverse spelling of an FPrt-universal word in two letters
- The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
- Permutations as minimal powers of a single-cycle class-sum
- A general framework for the polynomiality property of the structure coefficients of double-class algebras
- Title not available (Why is that?)
- A versatile combinatorial approach of studying products of long cycles in symmetric groups
- Factorization of permutations into n-cycles
- Factorizations of an \(n\)-cycle into two \(n\)-cycles
- A Differential Operator for Symmetric Functions and the Combinatorics of Multiplying Transpositions
- Quantifying CDS sortability of permutations by strategic pile size
- Title not available (Why is that?)
- Описание класса подстановок, представимых в виде произведения двух подстановок с фиксированным числом мобильных точек
This page was built for publication: Decomposing a Permutation into Two Large Cycles: An Enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964571)