Black box classical groups /
If a black box simple group is known to be isomorphic to a classical group over a field of known characteristic, a Las Vegas algorithm is used to produce an explicit isomorphism. The proof relies on the geometry of the classical groups rather than on difficult group-theoretic background. This algori...
Call Number: | Libro Electrónico |
---|---|
Main Author: | |
Other Authors: | |
Format: | Electronic eBook |
Language: | Inglés |
Published: |
Providence, R.I. :
American Mathematical Society,
©2001.
|
Series: | Memoirs of the American Mathematical Society ;
no. 708. |
Subjects: | |
Online Access: | Texto completo |
Table of Contents:
- 1. Introduction 2. Preliminaries 3. Special linear groups: PSL($d, q$) 4. Orthogonal groups: $P\Omega ^\epsilon (d, q)$ 5. Symplectic groups: $\mathrm {PSp}(2m, q)$ 6. Unitary groups: $\mathrm {PSU}(d, q)$ 7. Proofs of Theorems 1.1 and 1.1, and of Corollaries 1.2-1.4 8. Permutation group algorithms 9. Concluding remarks.