University of Washington
Cycle type factorizations in the finite general linear groups
Abstract
dc:description.abstractRecent work by Huang, Lewis, Morales, Reiner, and Stanton suggests that the regular elliptic elements of GLn \mathbb{F}q are somehow analogous to the $n$-cycles of the symmetric group. In 1981, Stanley enumerated the factorizations of permutations into products of $n$-cycles. We study the analogous problem in GLn \mathbb{F}q of enumerating factorizations into products of regular elliptic elements. More precisely, we define a notion of cycle type for GLn \mathbb{F}q 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 $q$, the problem of computing the probability that the product of a random tuple of regular elliptic elements has a given cycle type. Next, we prove some results regarding the polynomiality of our enumerative formulas. We conclude by slightly extending our main enumerative results and listing some open problems.
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Gordon, Graham Walker
- Advisor dc:contributor.advisor
-
- Billey, Sara
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- CC BY-NC-SA
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1773/46100