SearcharxivSearch

arXiv · 1403.2057

Generation of finite classical groups by pairs of elements with large fixed point spaces

Abstract

We study `good elements' in finite $2n$-dimensional classical groups $G$: namely $t$ is a `good element' if $o(t)$ is divisible by a primitive prime divisor of $q^n-1$ for the relevant field order $q$, and $t$ fixes pointwise an $n$-space. The group ${\rm{SL}}_{2n}(q)$ contains such elements, and they are present in ${\rm{Su}}_{2n}(q), {\rm{Sp}}_{2n}(q), {\rm{So}}^ε_{2n}(q)$, only if $n$ is odd, even, even, respectively. We prove that there is an absolute positive constant $c$ such that two random conjugates of $t$ generate $G$ with probability at least $c$, if $G\ne {\rm{Sp}}_{2n}(q)$ with $q$ even. In the exceptional case $G={\rm{Sp}}_{2n}(q)$ with $q$ even, two conjugates of $t$ never generate $G$: in this case we prove that two random conjugates of $t$ generate a subgroup ${\rm{SO}}^ε_{2n}(q)$ with probability at least $c$. The results (proved for all field orders at least $4$) underpin analysis of new constructive recognition algorithms for classical groups in even characteristic, which succeed where methods utilising involution centralisers are not available.

Explore related subjects

Keep this discovery

BibTeXRIS

Cheryl E. Praeger, Ákos Seress, Şükrü Yalçinkaya. 2014-05-08. Generation of finite classical groups by pairs of elements with large fixed point spaces. https://arxiv.org/abs/1403.2057

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