ALGORITHMS TO IDENTIFY ABUNDANTp-SINGULAR ELEMENTS IN FINITE CLASSICAL GROUPS

DOI10.1017/S0004972712000317zbMath1256.20049OpenAlexW1975457927WikidataQ56987538 ScholiaQ56987538MaRDI QIDQ2907021

Alice C. Niemeyer, Tomasz Popiel, Cheryl E. Praeger

Publication date: 5 September 2012

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972712000317

zbMATH Keywords

algorithmsrandom elementsfinite linear groups\(p\)-abundant elementsrecognition project

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Software, source code, etc. for problems pertaining to group theory (20-04) Probabilistic methods in group theory (20P05)

Related Items (2)

Abundant \(p\)-singular elements in finite classical groups. ⋮ Involution centralisers in finite unitary groups of odd characteristic

Cites Work

• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Estimating proportions of elements in finite groups of Lie type.
• Fast algorithms for the characteristic polynomial
• Isometrien von Vektorräumen. I
• Singer-Zyklen in klassischen Gruppen
• The Magma algebra system. I: The user language
• On the probability that a group element is \(p\)-singular
• Fast multiplication of large numbers
• A Recognition Algorithm for Special Linear Groups
• On the orders of primitive linear P'-groups
• A Recognition Algorithm For Classical Groups Over Finite Fields
• On Schönhage's algorithm and subquadratic integer gcd computation
• Endliche Gruppen I

This page was built for publication: ALGORITHMS TO IDENTIFY ABUNDANTp-SINGULAR ELEMENTS IN FINITE CLASSICAL GROUPS