DOAJ Open Access 2020

GL(n, q)-analogues of factorization problems in the symmetric group

Joel Brewster Lewis Alejandro H. Morales

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (2)

Joel Brewster Lewis

Alejandro H. Morales

Format Sitasi

APA MLA BibTeX

Lewis, J.B., Morales, A.H. (2020). GL(n, q)-analogues of factorization problems in the symmetric group. https://doi.org/10.46298/dmtcs.6382

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.6382

Informasi Jurnal

Tahun Terbit: 2020
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.6382
Akses: Open Access ✓