ALGORITHMS TO IDENTIFY ABUNDANTp-SINGULAR ELEMENTS IN FINITE CLASSICAL GROUPS
From MaRDI portal
Publication:2907021
DOI10.1017/S0004972712000317zbMath1256.20049WikidataQ56987538 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
68W30: Symbolic computation and algebraic computation
20G40: Linear algebraic groups over finite fields
20-04: Software, source code, etc. for problems pertaining to group theory
20P05: Probabilistic methods in group theory
Related Items
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