Factorization of permutations into n-cycles
From MaRDI portal
Publication:1155712
DOI10.1016/0012-365X(81)90224-7zbMath0467.20005MaRDI QIDQ1155712
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Representations of finite symmetric groups (20C30) Symmetric groups (20B30)
Related Items
A general framework for the polynomiality property of the structure coefficients of double-class algebras, Reflection decompositions in the classical Weyl groups, Unseparated pairs and fixed points in random permutations, A versatile combinatorial approach of studying products of long cycles in symmetric groups, Unnamed Item, Combinatorially refine a Zagier-Stanley result on products of permutations, On products of long cycles: short cycle dependence and separation probabilities, Hurwitz numbers for reflection groups, Hurwitz numbers for reflection groups I: generatingfunctionology, On products of permutations with the most uncontaminated cycles by designated labels, On products of conjugacy classes of the symmetric group, Factorizations of an \(n\)-cycle into two \(n\)-cycles, Odd permutations are nicer than even ones, Region distributions of graph embeddings and Stirling numbers, Cardinality of Rauzy classes, The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group, Single-hook characters and hamiltonian circuits∗, A Differential Operator for Symmetric Functions and the Combinatorics of Multiplying Transpositions, Inequivalent factorizations of permutations, Описание класса подстановок, представимых в виде произведения двух подстановок с фиксированным числом мобильных точек, \(\operatorname{GL}_n(\mathbb{F}_q)\)-analogues of factorization problems in the symmetric group, Unnamed Item, Plane Permutations and Applications to a Result of Zagier--Stanley and Distances of Permutations, Some combinatorial problems associated with products of conjugacy classes of the symmetric group, Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem, Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees, Rapidly mixing random walks and bounds on characters of the symmetric group, Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson, Cycle type factorizations in \(\mathrm{GL}_n \mathbb{F}_q\), Decomposition of certain products of conjugacy classes of \(S_ n\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How many ways can a permutation be factored into two n-cycles?
- Nombre de représentations d'une permutation comme produit de deux cycles de longueurs données
- Decomposing a Permutation into Two Large Cycles: An Enumeration
- Group Characters and the Structure of Groups
- Ramified coverings of Riemann surfaces
