+612 9045 4394
 
CHECKOUT
Groups and Computation : Proceedings of the International Conference at the Ohio State University, June 15-19, 1999 :  Proceedings of the International Conference at the Ohio State University, June 15-19, 1999 - W.M. Kantor

Groups and Computation : Proceedings of the International Conference at the Ohio State University, June 15-19, 1999

Proceedings of the International Conference at the Ohio State University, June 15-19, 1999

By: W.M. Kantor (Editor), Akos Seress (Editor)

Hardcover

Published: 2001
For Ages: 22+ years old
Ships: 7 to 10 business days
7 to 10 business days
RRP $803.99
$556.75
31%
OFF
or 4 easy payments of $139.19 with Learn more

This volume contains contributions by the participants of the conference "Groups and Computation", which took place at The Ohio State University in Columbus, Ohio, in June 1999. This conference was the successor of two workshops on "Groups and Computation" 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.

Preface
Probabilistic recognition of orthogonal and symplectic groupsp. 1
Janko's simple groups J[subscript 2] and J[subscript 3] are irreducible subgroups of SL[subscript 85](5) with equal centralizers of an involutionp. 21
Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groupsp. 39
Improved algorithms for the Tits alternativep. 63
A constructive recognition algorithm for the matrix group [Omega](d, q)p. 79
On constructive recognition of a black box PSL(d, q)p. 95
Fast recognition of classical groups over large fieldsp. 113
Parallel GAP: Mature interactive parallel computingp. 123
Computing with infinite polycyclic groupsp. 139
Computing the maximal subgroups of a permutation group Ip. 155
On p-singular elements in Chevalley groups in characteristic pp. 169
Experiments in coset enumerationp. 183
A presentation for the Thompson sporadic simple groupp. 193
Computing automorphism groups of finite groupsp. 201
Regular orbits and the [kappa](GV)-problemp. 209
The computational matrix group projectp. 229
Finding p'-elements in finite groups of Lie typep. 249
Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecturep. 257
Deterministic algorithms for management of matrix groupsp. 265
Nearly simple matrix groups: desiderata and suggestionsp. 281
Cyclic matrices and the MEATAXEp. 291
What do we know about the product replacement algorithm?p. 301
On the complexity of the endomorphism problem for free groupsp. 349
Talksp. 361
List of participantsp. 365
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783110167214
ISBN-10: 3110167212
Series: Ohio State University Mathematical Research Institute Public
Audience: Professional
For Ages: 22+ years old
Format: Hardcover
Language: English
Number Of Pages: 376
Published: 2001
Country of Publication: DE
Dimensions (cm): 24.41 x 16.99  x 2.24
Weight (kg): 0.8