Factorization problems in complex reflection groups
From MaRDI portal
Publication:5075658
Recommendations
Cites work
- A bijective proof of Jackson's formula for the number of factorizations of a cycle
- A PARTIAL ORDER ON THE ORTHOGONAL GROUP
- A refined count of Coxeter element reflection factorizations
- A simple model of trees for unicellular maps
- Absolute order in general linear groups
- An analogue of the Harer-Zagier formula for unicellular maps on general surfaces
- Arrangements defined by unitary reflection groups
- Automorphisms of complex reflection groups.
- Bijections and symmetries for the factorizations of the long cycle
- Comparing codimension and absolute length in complex reflection groups
- Counting factorizations of Coxeter elements into products of reflections.
- Cyclic sieving of noncrossing partitions for complex reflection groups.
- Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions
- Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group
- Enumerative properties of generalized associahedra
- Factoring \(n\)-cycles and counting maps of given genus
- Factorization problems in complex reflection groups
- Factorizations of large cycles in the symmetric group
- Finite complex reflection arrangements are \(K(\pi,1)\)
- Finite Unitary Reflection Groups
- Formula for the reflection length of elements in the group G(m,p,n).
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- scientific article; zbMATH DE number 5601747 (Why is no real title available?)
- scientific article; zbMATH DE number 3815664 (Why is no real title available?)
- scientific article; zbMATH DE number 52944 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1557062 (Why is no real title available?)
- scientific article; zbMATH DE number 3401124 (Why is no real title available?)
- Non-crossing partitions for classical reflection groups
- Non-crossing partitions of type \((e,e,r)\).
- Noncrossing Partitions for the GroupDn
- On enumerating factorizations in reflection groups
- On non-conjugate Coxeter elements in well-generated reflection groups
- Planar maps
- Some combinatorial problems associated with products of conjugacy classes of the symmetric group
- Some probabilistic trees with algebraic roots
- The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
- Transitive factorizations of permutations and geometry
- Unitary reflection groups and cohomology
Cited in
(16)- A refined count of Coxeter element reflection factorizations
- Fixed points and adjacent ascents for classical complex reflection groups
- Non-broken circuits of reflection groups and factorization in \(D_ n\)
- Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson
- Factorization problems in complex reflection groups
- On enumerating factorizations in reflection groups
- Counting factorizations of Coxeter elements into products of reflections.
- Submaximal factorizations of a Coxeter element in complex reflection groups
- Polynomiality of factorizations in reflection groups
- On enumerating factorizations in reflection groups
- Hurwitz numbers for reflection groups I: generatingfunctionology
- On products of permutations with the most uncontaminated cycles by designated labels
- Hurwitz numbers for reflection groups. II: Parabolic quasi-Coxeter elements
- Hurwitz numbers for reflection groups. III: Uniform formulae
- Coincidences between intervals in two partial orders on complex reflection groups
- Presentations of the braid group of the complex reflection group G(d,d,n)
This page was built for publication: Factorization problems in complex reflection groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075658)
