This volume contains contributions by the participants of the conference qGroups and Computation, q which took place at The Ohio State University in Columbus, Ohio, in June 1999. This conference was the successor of two workshops on qGroups and Computationq held at DIMACS in 1991 and 1995. There are papers on permutation group algorithms, finitely presented groups, polycyclic groups, and parallel computation, providing a representative sample of the breadth of Computational Group Theory. On the other hand, more than one third of the papers deal with computations in matrix groups, giving an in-depth treatment of the currently most active area of the field. The points of view of the papers range from explicit computations to group-theoretic algorithms to group-theoretic theorems needed for algorithm development.... p), where pagt;5 is a prime, andkagt;3 ([Gi]), (ii) G = PSL(2, 2m) or G = Sz(22m-1), where magt;2, andkagt;3 ([Ev3]), (iii) G = A6, Al. andk ... By Halla#39;s Theorem 1.2.1, the largest power N such that d(GN) alt; 2 is given by tr\ lG\2 [P(P-D(P+D]2 . , n N = W2( G) .

Title | : | Groups and Computation III |

Author | : | William M. Kantor, Ákos Seress |

Publisher | : | Walter de Gruyter - 2001 |

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

`1.`Register a free 1 month Trial Account.`2.`Download as many books as you like (Personal use)`3.`Cancel the membership at any time if not satisfied.