Cycle type factorizations in GL_n F_q

From MaRDI portal
Publication:2111946

DOI10.5802/ALCO.259zbMATH Open1506.05012arXiv2001.10572OpenAlexW4315784439MaRDI QIDQ2111946FDOQ2111946

Graham Gordon

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 mathrmGLnmathbbFq 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 mathrmGLnmathbbFq of enumerating factorizations into products of regular elliptic elements. More precisely, we define a notion of cycle type for mathrmGLnmathbbFq 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. 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





Cites Work



Recommendations





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)