Powers in finite orthogonal and symplectic groups: A generating function approach
Saikat Panja, Anupam Singh

TL;DR
This paper develops a generating function approach to classify and enumerate M-th powers in finite symplectic and orthogonal groups over finite fields, providing explicit probabilities for such elements.
Contribution
It introduces M*-power SRIM polynomials and classifies M-th power elements in classical groups using generating functions, extending previous enumeration methods.
Findings
Complete classification of M-th powers in classical groups
Explicit generating functions for enumeration
Probabilities of elements being M-th powers
Abstract
For an integer and a finite group , an element is called an -th power if it satisfies for some . In this article, we will deal with the case when is finite symplectic or orthogonal group over a field of order . We introduce the notion of -power SRIM polynomials. This, amalgamated with the concept of -power polynomial, we provide the complete classification of the conjugacy classes of regular semisimple, semisimple, cyclic and regular elements in , which are -th powers, when . The approach here is of generating functions, as worked on by Jason Fulman, Peter M. Neumann, and Cheryl Praeger in the memoir "A generating function approach to the enumeration of matrices in classical groups over finite fields". As a byproduct, we obtain the corresponding probabilities, in terms of generating functions.
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
Topicsgraph theory and CDMA systems · Finite Group Theory Research · Coding theory and cryptography
