On proportions of pre-involutions in finite classical groups. (Q606652): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 08:52, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On proportions of pre-involutions in finite classical groups. |
scientific article |
Statements
On proportions of pre-involutions in finite classical groups. (English)
0 references
18 November 2010
0 references
Key to a computational study of the finite classical groups in odd characteristic are efficient methods for constructing involutions and their centralisers. Constructing an involution in a given conjugacy class is usually achieved by finding an element of even order that powers up to an involution in the class. Lower bounds on the proportions of such elements are therefore required to control the failure probability of these algorithms. Previous results of \textit{C. W. Parker} and \textit{R. A. Wilson} [J. Algebra 324, No. 5, 885-915 (2010; Zbl 1208.20045)] give an \(O(n^{-3})\) lower bound that holds for all involution classes in \(n\)-dimensional simple classical groups in odd characteristic. In the present paper, the authors improve this lower bound to \(O(n^{-2}\log n)\), and in certain cases to \(O(n^{-1})\), and also treat a larger family of (not necessarily simple) classical groups.
0 references
finite classical groups
0 references
involutions
0 references
proportions
0 references
recognition algorithms
0 references
computational group theory
0 references
finite groups of Lie type
0 references
black-box groups
0 references