Groups and Computation1999 - Algebra Consists of papers presented at the workshop on Groups and Computation held at DIMACS. |
Contents
George Havas Leonard H Soicher and Robert A Wilson | 193 |
Christoph Köhler and Herbert Pahlings | 209 |
Charles R LeedhamGreen | 229 |
Copyright | |
6 other sections not shown
Other editions - View all
Groups and Computation II: Workshop on Groups and Computation, June 7-10, 1995 Larry Finkelstein,William M. Kantor No preview available - 1997 |
Groups and Computation II: Workshop on Groups and Computation, June 7-10, 1995 Larry Finkelstein,William M. Kantor No preview available - 1997 |
Common terms and phrases
algebra assume automorphism group Babai black box black-box group box group characteristic classical groups complement conjugacy classes conjugate connected component contains coset enumeration cyclic defined denote efa series elementary abelian elements of G endomorphism finite fields finite group finite simple groups given GL(n graph group G group of order Groups and Computation groups of Lie Hence input involution irreducible isomorphic k-tuple Lemma Let G Lie type log q Mathematics Subject Classification matrix groups maximal subgroups method minimal normal subgroup nilpotent nonabelian obtain p-group ParGAP pc group permutation groups permutation representation polycyclic groups polynomial presentation prime probability problem procedure product replacement proof Proposition random elements random walk recognition algorithm regular orbits result root subgroup Section semisimple semisimple elements Seress solvable solvable groups subgroup of G subspace Theorem 1.1 torus transvection unisingular vector W. M. Kantor