Groups and Computation III : : Proceedings of the International Conference at The Ohio State University, June 15-19, 1999 / / ed. by William M. Kantor, Ákos Seress.

• Superior document: Title is part of eBook package: De Gruyter DGBA Backlist Complete English Language 2000-2014 PART1
• MitwirkendeR: Altseimer, Christine,; Avanzi, Roberto M.,; Babai, László,; Beats, Robert,; Borovik, Alexandre V.,; Brooksbank, Peter A.,; Conder, Marston,; Cooperman, Gene,; Eick, Bettina,; Guralnick, Robert M.,; Havas, George,; Holt, Derek F.,; Hulpke, Alexander,; Kantor, William M.,; Kratzer, Mathias,; Köhler, Christoph,; Leedham-Green, Charles R.,; Lübeck, Frank,; Miasnikov, Alexei D.,; Michler, Gerhard O.,; Miyazaki, Takunari,; Myasnikov, Alexei G.,; Neumann, Peter M.,; Pahlings, Herbert,; Pak, Igor,; Praeger, Cheryl E.,; Ramsay, Colin,; Shalev, Aner,; Sims, Charles C.,; Soicher, Leonard H.,; Wilson, Robert A.,
• HerausgeberIn: Kantor, William M.,; Seress, Ákos,
• Place / Publishing House: Berlin ;, Boston : : De Gruyter, , [2014]; ©2001
• Year of Publication: 2014
• Edition: Reprint 2013
• Language: English
• Series: Ohio State University Mathematical Research Institute Publications , 8
• Physical Description: 1 online resource (368 p.) :; Zahlr. Abb.
• Other title: Frontmatter --; Preface --; Table of contents --; Probabilistic recognition of orthogonal and symplectic groups --; Janko’s simple groups J2 and J3 are irreducible subgroups of SL85(5) with equal centralizers of an involution --; Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups --; Improved algorithms for the Tits alternative --; A constructive recognition algorithm for the matrix group Ω (d, q) --; On constructive recognition of a black box PSL( d , q ) --; Fast recognition of classical groups over large fields --; Parallel GAP: Mature interactive parallel computing --; Computing with infinite polycyclic groups --; Computing the maximal subgroups of a permutation group I --; On p-singular elements in Chevalley groups in characteristic ρ --; Experiments in coset enumeration --; A presentation for the Thompson sporadic simple group --; Computing automorphism groups of finite groups --; Regular orbits and the k(GV)-problem --; The computational matrix group project --; Finding pʹ-elements in finite groups of Lie type --; Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture --; Deterministic algorithms for management of matrix groups --; Nearly simple matrix groups: desiderata and suggestions --; Cyclic matrices and the MEATAXE --; What do we know about the product replacement algorithm? --; On the complexity of the endomorphism problem for free groups --; Talks --; List of participants
• Format: Mode of access: Internet via World Wide Web.
• ISBN: 9783110872743; 9783110238570; 9783110238471; 9783110637205
• ISSN: 0942-0363
• DOI: 10.1515/9783110872743
• Access: restricted access
• Hierarchical level: Monograph
• Statement of Responsibility: ed. by 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.