Strong involutions in finite special linear groups of odd characteristic
type: Item
instance of: scholarly article
title: Strong involutions in finite special linear groups of odd characteristic
zbMATH Open document ID: 1437.20041
author: John D. Dixon
author: Cheryl E. Praeger
author: Ákos Seress
published in: Journal of Algebra
publication date: 2018-02-06T00:00:00Z
review text: In [J. Algebra 322, No. 3, 833--881 (2009; Zbl 1181.20044)], \textit{C. R. Leedham-Green} and \textit{E. A. O'Brien}, described an algorithm that constructs a generating set for classical groups over finite fields. The paper under review looks at this algorithm for \(\mathrm{SL}(n,q)\), and it is shown that the number of random elements required in this case is \(O(\log~n)\), which betters all known results. In the above-mentioned algorithm, a key step is to construct a strong involution \(t\) with \(\pm{1}\)-eigenspaces \(E_{\pm}\) whose dimension is between \(n/3\) and \(2n/3\). The main theorem of the paper asserts: There exist positive constants \(\kappa\) and \(n_0\) (which can be taken to be \(0.0002\) and \(n_0 = 700\) respectively) such that the following holds: if \(n \geq n_0\), \(t \in \mathrm{GL}(n,q)\) is a strong involution and \(g\) is a uniformly distributed random element of \(\mathrm{GL}(n,q)\), and \(z(g)\) is defined to be \(\mathrm{inv}(tt^g)\) (respectively \(I\)) according as to whether \(tt^g\) has even (respectively odd) order, then the restrictions of \(z(g)\) to the eigenspaces \(E_{\pm}(t)\) are strong involutions with probability at least \(k/\log(n)\). The proof uses properties of certain linear transformations over finite fields called ppd-elements (short for primitive prime divisors). The authors raise the question of proving an analogous theorem for other classical groups. Those interested in the subject matter of this paper may also be interested in looking at the paper [\textit{S. Bhunia} et al., Adv. Appl. Clifford Algebr. 30, No. 3, Paper No. 31, 23 p. (2020; Zbl 1458.20038)] which has some related but different type of results.
reviewed by: Balasubramanian Sury
Mathematics Subject Classification ID: 20G40
Mathematics Subject Classification ID: 20F69
Mathematics Subject Classification ID: 20P05
zbMATH DE Number: 6834839
zbMATH Keywords: Bray's algorithm
zbMATH Keywords: strong involution
zbMATH Keywords: primitive prime divisor
Wikidata QID: Q56987299
MaRDI profile type: Publication
OpenAlex ID: W2772298734
cites work: Probabilistic recognition of orthogonal and symplectic groups
cites work: An improved method for generating the centralizer of an involution
cites work: Cycle indices for the finite classical groups
cites work: A generating function approach to the enumeration of matrices in classical groups over finite fields
cites work: Linear Groups with Orders Having Certain Large Prime Divisors
cites work: Constructive membership in black-box groups
cites work: Constructive recognition of classical groups in odd characteristic.
cites work: Finding involutions in finite Lie type groups of odd characteristic.
cites work: A Recognition Algorithm For Classical Groups Over Finite Fields
cites work: Q4705904
cites work: Recognising simplicity of black-box groups by constructing involutions and their centralisers.
cites work: Probabilistic generation of finite classical groups in odd characteristic by involutions
cites work: Regular semisimple elements and involutions in finite general linear groups of odd characteristic.
cites work: Counting cyclic and separable matrices over a finite field
DOI: 10.1016/J.JALGEBRA.2017.11.047
Recommended article: Effective black-box constructive recognition of classical groups.
Recommended article: Generation of finite classical groups by pairs of elements with large fixed point spaces.
Recommended article: Q3840444
Recommended article: An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups
Recommended article: Generating random elements in finite groups.
Recommended article: A Recognition Algorithm For Classical Groups Over Finite Fields
Recommended article: A generating function approach to the enumeration of matrices in classical groups over finite fields
Recommended article: Generating random elements of a finite group
Recommended article: Probabilistic generation of finite classical groups in odd characteristic by involutions
Recommended article: On proportions of pre-involutions in finite classical groups.
description: scientific article; zbMATH DE number 6834839