2014/05/09 by Alice C. Niemeyer, Cheryl E. Praeger, Niemeyer, Alice C. +1
Computer Science · Engineering · Mathematics · #20G40 20P05 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Rings, Modules, and Algebras #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1405.2385
openalex publication_date 2014/05/09 · openalex created_date 2025/10/24 · openalex updated_date 2026/07/28
We estimate the proportion of several classes of elements in finite classical\ngroups which are readily recognised algorithmically, and for which some power\nhas a large fixed point subspace and acts irreducibly on a complement of it.\nThe estimates are used in complexity analyses of new recognition algorithms for\nfinite classical groups in arbitrary characteristic.\n