Reflection factorizations of Singer cycles
From MaRDI portal
Abstract: The number of shortest factorizations into reflections for a Singer cycle in GL_n(F_q) is shown to be (q^n-1)^(n - 1). Formulas counting factorizations of any length, and counting those with reflections of fixed conjugacy classes are also given. The method is a standard character-theory technique, requiring the compilation of irreducible character values for Singer cycles, semisimple reflections, and transvections. The results suggest several open problems and questions, which are discussed at the end.
Recommendations
Cites work
- A \(q\)-analog of the hook walk algorithm and random Young tableaux
- A New Approach to the Representation Theory of the Symmetric Groups. II
- A new construction of Young's seminormal representation of the symmetric groups
- A random q,t-hook walk and a sum of Pieri coefficients
- Arithmetic harmonic analysis on character and quiver varieties
- Character varieties with Zariski closures of \(\mathrm{GL}_n\)-conjugacy classes at punctures
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- Counting factorizations of Coxeter elements into products of reflections.
- Finite complex reflection arrangements are \(K(\pi,1)\)
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- Generating random elements in \(SL_ n(F_ q)\) by random transvections
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 3149991 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 739282 (Why is no real title available?)
- scientific article; zbMATH DE number 2117212 (Why is no real title available?)
- Representation theory of the symmetric groups. The Okounkov-Vershik approach, character formulas, and partition algebras.
- Representations of finite classical groups. A Hopf algebra approach
- Representations of groups. A computational approach.
- Some combinatorial problems associated with products of conjugacy classes of the symmetric group
- Springer's regular elements over arbitrary fields
- Symmetric polynomials and the center of the symmetric group ring
- The Characters of the Finite General Linear Groups
- The characters of the generalized Steinberg representations of finite general linear groups on the regular elliptic set
- The cyclic sieving phenomenon
- The dual braid monoid
- The Representations of GL(3,q), GL(4,q), PGL(3,q), and PGL(4,q)
Cited in
(17)- 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\)
- Coxeter factorizations and the matrix tree theorem with generalized Jucys-Murphy weights
- Quantum Hurwitz numbers and Macdonald polynomials
- scientific article; zbMATH DE number 3889797 (Why is no real title available?)
- A formula for the specialization of skew Schur functions
- scientific article; zbMATH DE number 6928879 (Why is no real title available?)
- \(\mathrm{GL}_n(\mathbf{F}_q)\)-analogues of factorization problems in \(\mathfrak{S}_n\)
- Generating functions for weighted Hurwitz numbers
- Reflections acting efficiently on a building
- On enumerating factorizations in reflection groups
- Coxeter factorizations with generalized Jucys–Murphy weights and Matrix‐Tree theorems for reflection groups
- Intersection theorems for finite general linear groups
- Transitivity in finite general linear groups
- Lyashko-Looijenga morphisms and primitive factorizations of Coxeter elements
- Klein's ten ``dessins d'enfants of degree 11: theme with variations
- \(\operatorname{GL}_n(\mathbb{F}_q)\)-analogues of factorization problems in the symmetric group
This page was built for publication: Reflection factorizations of Singer cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472626)
