Involution centralisers in finite unitary groups of odd characteristic
Abstract
We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of a strong involution that contains the last term of its derived series. We use this to strengthen previous bounds on the complexity of recognition algorithms for unitary groups in odd characteristic. Our approach generalises and extends two previous papers by the second author and collaborators on strong involutions and regular semisimple elements of linear groups.
Citation
Glasby , S , Praeger , C & Roney-Dougal , C M 2020 , ' Involution centralisers in finite unitary groups of odd characteristic ' , Journal of Algebra , vol. 545 , pp. 245-299 . https://doi.org/10.1016/j.jalgebra.2019.09.009
Publication
Journal of Algebra
Status
Peer reviewed
ISSN
0021-8693Type
Journal article
Description
Funding: Australian Research Council Discovery Project grants DP160102323 and DP190100450.Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.