Groups and Computation III Proceedings of the International Conference at The Ohio State University June 15 19 1999 1st Edition by William Kantor, Ákos Seress ISBN 978-3110167214 3110167212

Groups and Computation III Proceedings of the International Conference at The Ohio State University June 15 19 1999 1st Edition by William M. Kantor, Ákos Seress- Ebook PDF Instant Download/Delivery: 978-3110167214, 3110167212
Full download Groups and Computation III Proceedings of the International Conference at The Ohio State University June 15 19 1999 1st Edition after payment

Product details: 

ISBN 10:  3110167212

ISBN 13: 978-3110167214

Author: William M. Kantor, Ákos Seress

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.

Table of contents: 

1. Christine Altseimer and Alexandre V. Borovik – Probabilistic recognition of orthogonal and symplectic groups

2. Roberto M. Avanzi, Mathias Kratzer, and Gerhard O. Michler – Janko’s simple groups J2 and J3 are irreducible subgroups of SL₈₅(5) with equal centralizers of an involution

3. László Babai and Aner Shalev – Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups

4. Robert Beals – Improved algorithms for the Tits alternative

5. Peter A. Brooksbank – A constructive recognition algorithm for the matrix group (d, q)

6. Peter A. Brooksbank and William M. Kantor – On constructive recognition of a black box PSL(d, q)

7. Marston Conder and Charles R. Leedham-Green – Fast recognition of classical groups over large fields

8. Gene Cooperman – Parallel GAP: Mature interactive parallel computing

9. Bettina Eick – Computing with infinite polycyclic groups

10. Bettina Eick and Alexander Hulpke – Computing the maximal subgroups of a permutation group I

11. Robert M. Guralnick and Frank Lübeck – On p-singular elements in Chevalley groups in characteristic p

12. George Havas and Colin Ramsay – Experiments in coset enumeration

13. George Havas, Leonard H. Soicher, and Robert A. Wilson – A presentation for the Thompson sporadic simple group

14. Derek F. Holt – Computing automorphism groups of finite groups

15. Christoph Köhler and Herbert Pahlings – Regular orbits and the k(GV)-problem

16. Charles R. Leedham-Green – The computational matrix group project

17. Frank Lübeck – Finding p′-elements in finite groups of Lie type

18. Alexei D. Miasnikov and Alexei G. Myasnikov – Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture

19. Takunari Miyazaki – Deterministic algorithms for management of matrix groups

20. Peter M. Neumann – Nearly simple matrix groups: desiderata and suggestions

21. Peter M. Neumann and Cheryl E. Praeger – Cyclic matrices and the MEATAXE

22. Igor Pak – What do we know about the product replacement algorithm?

23. Charles C. Sims – On the complexity of the endomorphism problem for free groups

People also search for:

group theory and computer science
    
group computing
    
a computational introduction to number theory and algebra
    
two groups or one chegg
    
a group of computers working together for a common purpose

Tags: William Kantor, Ákos Seress, Groups and Computation, the International, The Ohio