Search arXivSearch

arXiv · 1001.3184

Construction of long root SL(2,q)-subgroups in black box groups

Abstract

We present a one sided Monte--Carlo algorithm which constructs a long root $\sl_2(q)$-subgroup in $X/O_p(X)$, where $X$ is a black-box group and $X/O_p(X)$ is a finite simple group of Lie type defined over a field of odd order $q=p^k > 3$ for some $k\geqslant 1$. Our algorithm is based on the analysis of the structure of centralizers of involutions and can be viewed as a computational version of Aschbacher's Classical Involution Theorem. We also present an algorithm which determines whether the $p$-core (or "unipotent radical") $O_p(X)$ of a black-box group $X$ is trivial or not, where $X/O_p(X)$ is a finite simple classical group of odd characteristic $p$. This answers a well-known question of Babai and Shalev.

Explore related subjects

Keep this discovery

BibTeXRIS

Sukru Yalcinkaya. 2010-01-19. Construction of long root SL(2,q)-subgroups in black box groups. https://arxiv.org/abs/1001.3184

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