Cycle type factorizations in GL_n F_q
From MaRDI portal
Publication:2111946
DOI10.5802/ALCO.259zbMATH Open1506.05012arXiv2001.10572OpenAlexW4315784439MaRDI QIDQ2111946FDOQ2111946
Publication date: 17 January 2023
Published in: Algebraic Combinatorics (Search for Journal in Brave)
Abstract: Recent work by Huang, Lewis, Morales, Reiner, and Stanton suggests that the regular elliptic elements of are somehow analogous to the -cycles of the symmetric group. In 1981, Stanley enumerated the factorizations of permutations into products of -cycles. We study the analogous problem in of enumerating factorizations into products of regular elliptic elements. More precisely, we define a notion of cycle type for and seek to enumerate the tuples of a fixed number of regular elliptic elements whose product has a given cycle type. In some special cases, we provide explicit formulas, using a standard character-theoretic technique due to Frobenius by introducing simplified formulas for the necessary character values. We also address, for large , the problem of computing the probability that the product of a random tuple of regular elliptic elements has a given cycle type. We conclude with some results about the polynomiality of our enumerative formulas and some open problems.
Full work available at URL: https://arxiv.org/abs/2001.10572
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Polynomials over finite fields (11T06) Ordinary representations and characters (20C15)
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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hurwitz numbers and intersections on moduli spaces of curves.
- The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- The Characters of the Finite General Linear Groups
- On the Representations of the Symmetric Group
- Cycle indices for the finite classical groups
- Reflection factorizations of Singer cycles
- Genus \(0\) and \(1\) Hurwitz numbers: Recursions, formulas, and graph-theoretic interpretations
- The cohomology of the regular semisimple variety
- 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
- Factorization of permutations into n-cycles
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- A Geometric Approach to the Representations of the Full Linear Group Over a Galois Field
- Counting factorizations of Coxeter elements into products of reflections
- Some asymptotic results on finite vector spaces
- The Invariant Subspace Lattice of a Linear Transformation
- The cycle structure of a linear transformation over a finite field
- \(\operatorname{GL}_n(\mathbb{F}_q)\)-analogues of factorization problems in the symmetric group
- Decomposing a Permutation into Two Large Cycles: An Enumeration
- Absolute order in general linear groups
Recommendations
- Cycle indices for the finite classical groups 👍 👎
- Reflection factorizations of Singer cycles 👍 👎
- On the regular semisimple elements and primary classes of \(\text{GL}(n,q)\). 👍 👎
- \(\operatorname{GL}_n(\mathbb{F}_q)\)-analogues of factorization problems in the symmetric group 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Cycle type factorizations in \(\mathrm{GL}_n \mathbb{F}_q\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111946)