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

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 fac...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. DMTCS Proceedings, 28th...
Main Authors:	Lewis, Joel Brewster, Morales, Alejandro H.
Format:	Journal Article Conference Proceeding
Language:	English
Published:	DMTCS 22.04.2020 Discrete Mathematics & Theoretical Computer Science
Subjects:	[math.math-co]mathematics [math]/combinatorics [math.co] Combinatorics Mathematics
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!