Search arXivSearch

arXiv · 2202.11513

Powers in finite orthogonal and symplectic groups: A generating function approach

Abstract

For an integer $M\geq 2$ and a finite group $G$, an element $\alpha\in G$ is called an $M$-th power if it satisfies $A^M=\alpha$ for some $A\in G$. In this article, we will deal with the case when $G$ is finite symplectic or orthogonal group over a field of order $q$. We introduce the notion of $M^*$-power SRIM polynomials. This, amalgamated with the concept of $M$-power polynomial, we provide the complete classification of the conjugacy classes of regular semisimple, semisimple, cyclic and regular elements in $G$, which are $M$-th powers, when $(M,q)=1$. 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Saikat Panja, Anupam Singh. 2022-02-22. Powers in finite orthogonal and symplectic groups: A generating function approach. https://arxiv.org/abs/2202.11513

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR