SearcharxivSearch

arXiv · 1007.2983

Proportions of elements with given 2-part order in finite classical groups of odd characteristic

Abstract

For an element $g$ in a group $X$, we say that $g$ has 2-part order $2^{a}$ if $2^{a}$ is the largest power of 2 dividing the order of $g$. We prove lower bounds on the proportion of elements in finite classical groups in odd characteristic that have certain 2-part orders. In particular, we show that the proportion of odd order elements in the symplectic and orthogonal groups is at least $C/\ell^{3/4}$, where $\ell$ is the Lie rank, and $C$ is an explicit constant. We also prove positive constant lower bounds for the proportion of elements of certain 2-part orders independent of the Lie rank. Furthermore, we describe how these results can be used to analyze part of Yal\c{c}inkaya's Black Box recognition algorithm for finite classical groups in odd characteristic.

Explore related subjects

Keep this discovery

BibTeXRIS

Simon Guest, Cheryl E. Praeger. 2010-07-18. Proportions of elements with given 2-part order in finite classical groups of odd characteristic. https://arxiv.org/abs/1007.2983

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