Generating functions for the powers in $\text{GL}(n,q)$
Rijubrata Kundu, Anupam Singh

TL;DR
This paper derives generating functions to count powers and conjugacy classes in the general linear group over finite fields, focusing on regular, semisimple, and all elements for various conditions on M and q.
Contribution
It provides explicit generating functions for counting M-th powers and conjugacy classes in GL(n,q) under different algebraic conditions, extending previous enumeration methods.
Findings
Generated functions for regular and semisimple elements when (q,M)=1
Derived formulas for semisimple elements when M is a prime power and (q,M)=1
Established generating functions for all elements when M is a prime and q is a power of M
Abstract
Consider the set of all powers for an integer . In this article, we aim to enumerate the regular, regular semisimple and semisimple elements as well as conjugacy classes in the set , i.e., the elements or classes of these kinds which are powers. We get the generating functions for (i) regular and regular semisimple elements (and classes) when , (ii) for semisimple elements and all elements (and classes) when is a prime power and , and (iii) for all kinds when is a prime and is a power of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Advanced Algebra and Geometry
