Joel Brewster Lewis ; Alejandro H. Morales - GL(n, q)-analogues of factorization problems in the symmetric group

dmtcs:6382 - Discrete Mathematics & Theoretical Computer Science, April 22, 2020, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) - https://doi.org/10.46298/dmtcs.6382
GL(n, q)-analogues of factorization problems in the symmetric groupArticle

Authors: Joel Brewster Lewis 1; Alejandro H. Morales 2

  • 1 School of Mathematics
  • 2 Department of Mathematics [Univ California Davis]

We consider GLn (Fq)-analogues of certain factorization problems in the symmetric group Sn: ratherthan counting factorizations of the long cycle(1,2, . . . , n) given the number of cycles of each factor, we countfactorizations of a regular elliptic element given the fixed space dimension of each factor. We show that, as in Sn, the generating function counting these factorizations has attractive coefficients after an appropriate change of basis.Our work generalizes several recent results on factorizations in GLn (Fq) and also uses a character-based approach.We end with an asymptotic application and some questions.


Volume: DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
Published on: April 22, 2020
Imported on: July 4, 2016
Keywords: [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Funding:
    Source : OpenAIRE Graph
  • PostDoctoral Research Fellowship; Funder: National Science Foundation; Code: 1401792

Consultation statistics

This page has been seen 189 times.
This article's PDF has been downloaded 204 times.