Handbook of computational group theory

Handbook of Computational Group Theory

Volumn , Issue , 2005, Pages 1-514

  Holt, Derek F ^a   Eick, Bettina ^b   O'Brien, Eamonn A ^c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^c UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85057421439     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (246)

1. JM Alonso T Brady D Cooper V Ferlini M Lustig M Mi halik M Shapiro and H Short Notes on word hyperbolic groups In A Haefliger 'É Ghys and A Verjovsky editors Group Theory from a Geometrical Viewpoint (Trieste 1990) pages 363 World Sci Publishing Co Inc River Edge NJ 1991
2. SI Adian On algorithmic problems in effectively complete classes of groups Doklady Akad Nauk SSR 123:13-16 1958
3. S I Adian The Burnside Problem and Identities in Groups Springer Verlag Berlin 1979 Translated from the Russian by John Lennox and James Wiegold
4. AV Aho AV Hopcroft and JD Ullrnan The Design and Analysis of Computer Algorithms Reading: Addison Wesley 1974
5. EF Assmus Jr and Jenny Key Designs and Their Codes volume 103 of CUP Tracts in Mathematics Cambridge University Press 1992
6. DG Arrell S Manrai and MF Worboys A procedure for obtaining simplified defining relations for a subgroup In CM Campbell and EF Robertson editors Groups St Andrews 1981 volume 71 of London Math Soc Lecture Note Ser pages 155-159 Cambridge 1982 Cambridge University Press
7. Claude Archer Classification of group extensions PhD thesis Universite Libre de Bruxelles 2002
8. E Artin The orders of the classical simple groups Comm Pure Appl Math, 8:455-472 1955
9. M Aschbacher On the maximal subgroups of the finite classical groups Invent Math, 76:469-514 1984
10. MD Atkinson An algorithm for finding the blocks of a permutation group Math Comp 29:911-913 1975
11. Michael D Atkinson editor Computational Group Theory London New York 1984 (Durham 1982) Academic Press
12. ATLAS of Finite Group Representations http://webmatbhamacuk/atlas/indexhtml
13. Laszlo Babai Local expansion of vertex transitive graphs and random generation in finite groups In Theory of Computing pages 164 174 New York 1991 (Los Angeles 1991) Association for Computing Machinery
14. L Babai and R Beals A polynomial time theory for black box groups I In Groups St Andrews 1997 in Bath volume 261 of London Math Soc Lecture Note Ser pages 30-64 Cambridge 1999 Cambridge University Press
15. Harold Brown Rolf Billow Joachim Neubiiser Hans Won dratschek and Hans Zassenhaus Crystallographic Groups of Four Dimensional Space Wiley Interscience New York Chicester Brisbane Toronto 1978
16. Laszlo Babai Robert Beals and Daniel Rockmore Deciding finiteness of matrix groups in deterministic polynomial time In Proc of International Symposium on Symbolic and Algebraic Computation ISSAC ’93 pages 117-126 (Kiev) ACM Press 1993
17. Gregory Butler and John J Cannon Computing in permutation and matrix groups I: Normal closure commutator subgroups series Math Comp 39:663-670 1982
18. Gregory Butler and John J Cannon Computing in permutation and matrix groups III: Sylow subgroups J Symbolic Comput 8:241-252 1989
19. Gregory Butler and John J Cannon Computing Sylow subgroups using homomorphic images of centralizers J Symbolic Comput 12:443-458 1991
20. Wieb Bosma and John Cannon Handbook of Magma Functions School of Mathematics and Statistics University of Sydney 1993
21. Laszlo Babai Gene Cooperman Larry Finkelstein and Akos Seress Nearly linear time algorithms for permutation groups with a small base In Proc of International Symposium on Symbolic and Algebraic Computation ISSAC ’91 pages 200-209 (Bonn) ACM Press 1991
22. G Baumslag FB Cannonito and CF Miller III Computable algebra and group embeddings J Algebra 69:186-212 1981
23. G Baumslag FB Cannonito and CF Miller III Some recognizable properties of solvable groups Math Z 178:289-295 1981
24. Hans Ulrich Besche and Bettina Eick Construction of finite groups J Symbolic Cornput 27:387-404 1999
25. Hans Ulrich Besche and Bettina Eick The groups of order at most 1000 except 512 and 768 J Symbolic Cornput, 27:405-413 1999
26. Hans Ulrich Besche and Bettina Eick The groups of order qn p Comm Algebra 29:1759-1772,2001
27. Robert M Beals Computing blocks of imprimitivity for small base groups in nearly linear time In Finkelstein and Kantor AJ Bayes J Kautsky and JW Wamsley Computation in nilpotent groups (application) In Proc Second Internat Conf Theory of Groups volume 372 of Lecture Notes in Math, pages 82-89 Berlin Heidelberg New York 1974 (Canberra 1973) Springer Verlag
28. R Beals CR Leedham Green AC Niemeyer CE Praeger and A Seress Permutations with restricted cycle structure and an algorithmic application Corribin Probab Comput 11:447-464 2002
29. G Butler and J McKay The transitive groups of degree up to 11 Comm Algebra 11:863-911 1983
30. WW Boone The word problem Annals of Mathematics 70:207-265 1959
31. S Bratus and I Pak Fast constructive recognition of a black box group isomorphic to Sn or An using Goldbach’s conjecture J Symbolic Comput 29:33-57 2000
32. Harold Brown An algorithm for the determination of space groups Math Comp 23:499-514 1969
33. PA Brooksbank Constructive recognition of classical groups in their natural representation J Symbolic Comput, 35:195-239 2003
34. Laszlo Babai and Endre Szemeredi On the complexity of matrix group problems I In Proc 25th IEEE Sympos Foundations Comp Sci pages 229-240 1984
35. B Buchberger The history and basic features of the critical pair/completion procedure J Symbolic Comput 3:3-38 1987
36. W Burnside On an unsettled question in the theory of discontinuous groups Quart J Pure Appl Math 33:230-238 1902
37. Gregory Butler Computing normalizers in permutation groups J Algorithms 4:163-175 1983
38. Gregory Butler On computing double coset representatives in permutation groups In Atkinson [Atk84] pages 283-290
39. Gregory Butler Fundamental Algorithms for Permutation Groups volume 559 of Lecture Notes in Comput Sci Springer Verlag Berlin Heidelberg New York 1991
40. Gregory Butler The transitive groups of degree fourteen and fifteen J Symbolic Comput 16:413-422 1993
41. PJ Cameron Finite permutation groups and finite simple groups Bull Lon Math Soc 13:1-22 1981
42. Peter J Cameron Permutation Groups volume 45 of London Math Soc Stud Texts Cambridge University Press Cambridge 1999
43. John J Cannon Graphs and defining relations In Proc First Australian Conf on Combinatorial Mathematics pages 215-233 (Newcastle 1972) 1972
44. John J Cannon Construction of defining relators for finite groups Discrete Math, 5:105-129 1973
45. James W Cannon The combinatorial structure of cocompact discrete hyperbolic group Georri Dedicata 296:123-148 1984
46. Roger W Carter Simple Groups of Lie Type John Wiley and Sons London New York Sydney Toronto 1972
47. JJ Cannon BC Cox and DF Holt Computing chief series composition series and socles in large permutation groups J Symbolic Comput 24:285-301 1997
48. JJ Cannon BC Cox and DF Holt Computing Sylow subgroups of permutation groups J Symbolic Comput 24:303-316 1997
49. JJ Cannon BC Cox and DF Holt Computing the subgroups of a permutation group J Symbolic Comput 31:149-161 2001
50. JH Conway RT Curtis SP Norton RA Parker and RA Wilson Atlas of Finite Groups Clarendon Press Oxford 1985
51. W Burnside Theory of Groups of Finite Order Cambridge University Press Reprinted by Dover 1955 New York 2nd edition 1911
52. M Conder and P Dobcsanyi Trivalent symmetric graphs 011 up to 768 vertices J Combin MatJi Combin Cornput 40:41-63 2002
53. M Conder and P Dobcsanyi Applications and adaptations of the low index subgroups procedure Math Comp 74:485-497 2005
54. John J Cannon Lucien A Dirnino George Havas and Jane MWatson Implementation and analysis of the Todd Coxeter algorithm Math Comp 27:463-490 1973
55. John Cannon Bettina Eick and Charles Leedharn Green Special polycyclic generating sequences for finite soluble groups To appear in J Symbolic Comput 2004
56. Gene Cooperman and Larry Finkelstein A fast cyclic base change for permutation groups In Proceedings of International Symposium on Symbolic and Algebraic Computation IS SAC ’92 pages 224-232 ACM Press 1992
57. T Chinburg E Friedman KN Jones and AW Reid The arithmetic hyperbolic 3 manifold of smallest volume Ann Scuola Norm Sup Pisa Cl Sci (4) 30:1-40 2001
58. G Cooperman L Finkelstein and N Sarawagi A random base change algorithm for permutation groups In Proc of International Symposium on Symbolic and Algebraic Computation ISSAC ’90 pages 161-168 (Kiev) ACM Press 1990
59. John J Cannon and Derek F Holt Automorphism group computation and isomorphism testing in finite groups J Symbolic Comput 35:241-267 2003
60. John J Cannon and Derek F Holt Computing maximal subgroups of finite groups J Symbolic Comput 37:589-609 2004
61. R Charney Geodesic automation and growth functions for Artin groups of finite type Math Ann 301:307-324 1995
62. The CHEVIE Homepage http://wwwmathrwth aachende/homes/CHEVIE/
63. F Celler and CR Leedham Green Calculating the order of an invertible matrix In Finkelstein and Kantor F Celler and CR Leedham Green A constructive recognition algorithm for the special linear group In The Atlas of Finite Groups: Ten Years On volume 249 of London Mathemtical Society Lecture Note Series pages 11-26 1998
64. Frank Celler Charles R Leedham Green Scott H Murray Alice C Niemeyer and EA O’Brien Generating random elements of a finite group Comm Algebra 23:4931-4948 1995
65. MDE Conder CR Leedham Green and EA O’Brien Constructive recognition of PSL(2, g) To appear in Trans Amer Math Soc
66. Thomas H Cormen Charles E Leiserson Ronald L Rivest and Clifford Stein Introduction to Algorithms MIT Press Cambridge MA London 2nd edition 2002
67. Arjeh M Cohen Scott H Murray and DE Taylor Computing in groups of Lie type Math Comp 73:1477-1498 2004
68. Frank Celler Joachim Neubiiser and Charles R B Wright Some remarks on the computation of complements and normalizes in soluble groups Acta Applicandae Mathematicae 21:57-76 1990
69. Henri Cohen A Course in Computational Algebraic Number Theory volume 138 of Graduate Texts in Math Springer Verlag Inc New York 1973
70. Conway polynomials for finite fields http://www mathrwth aachende/~FrankLuebeck/ConwayPol/
71. The clrscode Package for La'TeX2e http://wwwcsdartmouthedu/thc/clrscode/
72. John Cannon and Catherine Playoust An Introduction to Magma School of Mathematics and Statistics University of Sydney 1993
73. CM Campbell and EF Robertson A deficiency zero presentation for SL(2, p) Bull Lon Math Soc 12:17-20 1980
74. JJ Cannon and B Souvignier On the computation of con jugacy classes in permutation groups In W Kuchlin editor Proceedings of International Symposium on Symbolic and Algebraic Computation Maui July 21 23 1997 pages 392-399 Association for Computing Machinery 1997
75. JJ Cannon and B Souvignier On the computation of normal subgroups in permutation groups unpublished 1998
76. D Coppersmith and S Winograd Matrix multiplication via arithmetic progressions J Symbolic Comput 8:251-280,1990
77. DG Cantor and H Zassenhaus A new algorithm for factoring polynomials over a finite field Math Comp 36:587-592 1981
78. M Dehn Über unendliche diskontinuierliche Gruppen Math Ann 71:116-144 1911
79. Karel Dekimpe Almost Bieberbach Groups: Affine and Polynomial Structures volume 1639 of Lecture notes in Math Springer 1996
80. JR Driscoll and ML Furst Computing short generating sequences Info and Cornput 72:117-132 1987
81. P Diaconis RL Graham and WM Kantor The mathematics of perfect shuffles Adv in Appl Math 4:175-196 1983
82. Klaus Doerk and Trevor Hawkes Finite Solvable Groups De Gruyter 1992
83. John D Dixon High speed computation of group characters Numer Math, 10:446-450 1967
84. John D Dixon The solvable length of a solvable linear group Math Z 107:151-158 1968
85. John D Dixon and Brian Mortimer The primitive permutation groups of degree less than 1000 Math Proc Camb Phil Soc 103:213-238 1988
86. John D Dixon and Brian Mortimer Permutation Groups volume 163 of Graduate Texts in Math Springer Verlag New York Heidelberg Berlin 1996
87. Anke Dietze and Mary Schaps Determining subgroups of a given finite index in a finitely presented group Canad J Math 26:769-782 1974
88. N M Dunfield and W P Thurston The virtual Haken conjecture: experiments and examples Georn Topol 7:399-441 2003
89. David BA Epstein JW Cannon DF Holt SVF Levy MS Paterson and WP Thurston Word Processing in Groups Jones and Bartlett Boston 1992
90. S Even and O Goldreich The minimum length generator problem is NP hard J Algorithms 2:311-313 1981
91. Bettina Eick F Gahler and W Nickel Computing maximal subgroups and Wyckoff positions of space groups Acta Cryst A 53:467-474 1997
92. Bettina Eick and A Hulpke Computing the maximal subgroups of a permutation group I In Kantor and Seress Bettina Eick and Burkhard Hofling The solvable primitive permutation groups of degree at most 6560 LMS J Comput Math 6:29-39 2003
93. EHR91] DBA Epstein DF Holt and SE Rees The use of Knuth Bendix methods to solve the word problem in automatic groups J Symbolic Comput 12:397-414 1991
94. Bettina Eick Spezielle PAG Systeme irn Computeralgebrasys tem GAP Diplomarbeit RWTH Aachen 1993
95. Bettina Eick Special presentations for finite soluble groups and computing (pre) Frattini subgroups In Finkelstein and Kantor Bettina Eick Algorithms for polycyclic groups Habilitation sschrift Universitat Kassel 2001
96. Bettina Eick Computing with infinite polycyclic groups In Kantor and Seress Bettina Eick Orbit stabilizer problems and computing normalizes for polycyclic groups J Symbolic Comput 34:1 19 2002
97. DBA Epstein AR Iano Fletcher and U Zwick Growth functions and automatic groups Experimental Math 5:297 315 1996
98. Bettina Eick CR Leedham Green and EA O’Brien Constructing automorphism groups of p groups Comm Algebra 30:2271 2295 2002
99. Bettina Eick AC Niemeyer and O Panaia An infinite polycyclic quotient algorithm Submitted
100. Bettina Eick and EA O’Brien Enumerating p groups J Austral Math Soc Ser A 67:191 205 1999
101. Bettina Eick and Gretchen Ostheimer On the orbit stabilizer problem for integral matrix actions of polycyclic groups Math Comp 72:1511 1529 2003
102. D Easdown and CE Praeger On minimal faithful permutation representations of finite groups Bull Aust Math Soc 38:207 220 1988
103. Bettina Eick and Charles RB Wright Computing subgroups by exhibition in finite solvable groups J Symbolic Comput 33:129 143 2002
104. H Felsch Programmierung der Restklassenabzahlung einer Gruppe nach Untergruppen Numer Math 3:250-256 1961
105. M Furst J Hopcroft and E Luks Polynomial time algorithms for permutation groups In Proc 21st IEEE Sympos Foundations Comp Sci pages 36-41 1980
106. Larry Finkelstein and William M Kantor editors Groups and Computation volume 11 of Amer Math Soc DIM ACS Series (DIMACS 1991) 1993
107. Larry Finkelstein and William M Kantor editors Groups and Computation II volume 28 of Amer Math Soc DIMACS Series (DIMACS 1995) 1997
108. V Felsch and J Neubiiser Uber ein Programm zur Berechnung der Automorphismengruppe einer endlichen Gruppe Numer Math, 11:277-292 1968
109. V Felsch and J Neubiiser On a programme for the determination of the automorphism group of a finite group In Computational Problems in Abstract Algebra pages 59 60 Oxford London Edinburgh 1970 (Oxford 1967) Pergamon Press
110. V Felsch and J Neubiiser An algorithm for the computation of conjugacy classes and centralizers in p groups In Edward W Ng editor Symbolic and Algebraic Computation volume 72 of Lecture Notes in Comput Sci pages 452-465 Berlin Heidelberg New York 1979 (Marseille 1979) Springer Verlag
111. The GAP Character Table Library http://www mathrwth aachende/~ThomasBreuer/ctbllib/
112. The GAP Group GAP Groups Algorithms and Programming Version 4 4: 2004 (http://wwwgap systemorg)
113. Wolfgang Gaschiitz Uber dieO Untergruppe endlicher Grup pen Math Z 58:160-170 1953
114. KO Geddes SR Czapor and G Labahn Algorithms for Computer Algebra Kluwer Academic Publishers 1992
115. E Ghys and P de la Harpe editors Sur les groupes hy perboliques d’apres Mikhael Gromov volume 83 of Progress in Mathematics Birkhauser Boston Inc Boston MA 1990
116. SP Glasby and RB Howlett Writing representations over minimal fields Comm Algebra 25:1703-1711 1997
117. RH Gilman Presentations of groups and monoids J Algebra 57:544-554 1979
118. RH Gilman Enumerating infinitely many cosets In Atkinson George Havas Derek F Holt and Sarah Rees Recognizing badly presented Z modules Linear Algebra Appl 192:137-163 1993
119. Graham Higman Some remarks on varieties of groups Quart J Math Oxford Ser (2) 10:165-178 1959
120. JA Hillman Four Manifolds Geometries and Knots volume 5 of Geometry and Topology Monographs Geometry and Topology Publications Mathematics Institute University of Warwick 2002
121. G Hiss Algorithms of representation theory In Computer Algebra Handbook: Foundations Applications Systems pages 84-88 Springer Verlag 2003
122. George Havas and LG Kovacs Distinguishing eleven crossing knots In Atkinson G Hiss and K Lux Drauer Trees of Sporadic Groups Oxford University Press 1989
123. LS Heath and NA Loehr New algorithms for generating Conway polynomials over finite fields J Symbolic Comput 38:1003-1024,2004
124. Derek F Holt CR Leedham Green EA O’Brien and Sarah Rees Computing matrix group decompositions with respect to a normal subgroup J Algebra 184:818-838 1996
125. Derek F, Holt C R, Leedham Green E A O’Brien and Sarah Rees Testing matrix groups for primitivity J Algebra 184:795-817 1996
126. George Havas and Bohdan S Majewski Integer matrix diago nalization J Symbolic Comput 24:399-408 1997
127. G Havas Bohdan S Majewski and KR Matthews Extended GCD and Hermite normal form algorithms via lattice basis reduction (addenda and errata) Experimental Math 8:205 1999
128. JE Hopcroft R Motwani and JD Ullman Introduction to Automata Theory Languages and Computation Addison Wesley 2nd edition 2001
129. George Havas and MF Newman Application of computers to questions like those of Burnside In Burnside Groups volume 806 of Lecture Notes in Math pages 211 230 Berlin Heidelberg New York 1980 (Bielefeld 1977) Springer Verlag
130. George Havas MF Newman and EA O’Brien Groups of deficiency zero In G Baumslag et al editors Geometric arid Computational Perspectives on Infinite Groups volume 25 of Amer Math Soc DIM ACS Series pages 53-67 (DIM ACS 1994) 1995
131. DF Holt The calculation of the Schur multiplier of a permutation group In Atkinson DF Holt A computer program for the calculation of a covering group of a finite group J Pure Appl Algebra 35:287-295 1985
132. DF Holt The mechanical computation of first and second cohomology groups J Symbolic Comput 1:351-361 1985
133. DF Holt The computation of normalizers in permutation groups J Symbolic Comput, 12:499-516 1991
134. Derek F Holt The Warwick automatic group software In G Baumslag et al editors Geometric and Computational Perspectives on Infinite Groups volume 25 of Amer Math Soc DIMACS Series pages 69-82 (DIMACS 1994) 1995
135. Derek F Holt Representing quotients of permutation groups Quart J Math (Oxford) 48:347-350 1997
136. JE Hopcroft An nlogn algorithm for minimizing the states in a finite automaton In Z Kohavi editor The Theory of Machines and Computations pages 189-196 New York 1971 Academic Press
137. Derek F Holt and W Plesken Perfect Groups Clarendon Press Oxford 1989
138. Derek F Holt and Sarah Rees Testing for isomorphism between finitely presented groups In Groups Combinatorics and Geometry volume 165 of London Math Soc Lecture Note Ser pages 459-475 London 1992 Durham 1989 Cambridge University Press
139. Derek F Holt and Sarah Rees A graphics system for displaying finite quotients of finitely presented groups In Finkelstein and Kantor Donald E Knuth The Art of Computer Programming Volume 2: Seminumerical Algorithms Addison Wesley Massachusetts 1969
140. Donald E Knuth The Art of Computer Programming Volume 3: Sorting and Searching Addison Wesley Massachusetts 1973
141. D Knuth Notes on efficient representation of perm groups 1981
142. G Kolata Perfect shuffles and their relation to math Science 216:505-506 1982
143. William M Kantor and Akos Seress editors Groups and Computation III volume 8 of Ohio State University Research Institute Publications Berlin New York 1997 (DIMACS 1999) Walter de Gruyter
144. WM Kantor and A Seress Black box classical groups Memoirs Amer Math Soc 149 No 708 2001
145. Reinhard Laue Computing double coset representatives for the generation of solvable groups In Jacques Calmet editor Computer algebra : EUROCAM ’82 European Computer Algebra Conference Marseille France 5 7 April 1982 volume 144 of Lecture Notes in Comput Sci pages 65-70 Berlin 1982 Springer
146. P LeChenadec A catalogue of complete presentations J Symbolic Comput 2:363-381 1986
147. John Leech Coset enumeration on digital computers Proc Camb Phil Soc 59:257-267 1963
148. J Leech editor Computational problems in abstract algebra Oxford 1970 (Oxford 1967) Pergamon Press
149. Jeffrey S Leon Finding the order of a permutation group In Bruce Cooperstein and Geoffrey Mason editors Finite Groups volume 37 of Proc Sympos Pure Math pages 511-517 Providence RI 1980 (Santa Cruz 1979) Arner Math Soc
150. Jeffrey S Leon On an algorithm for finding a base and strong generating set for a group given by generating permutations Math Comp 20:941-974 1980
151. Jeffrey S Leon Computing automorphism groups of combinatorial objects In Atkinson Eugene M Luks Isomorphism of graphs of bounded valence can be tested in polynomial time J Comp Syst ScA 25:42-65 1982
152. Eugene M Luks Computing in solvable matrix groups In Proc 33rd IEEE Sympos Foundations Comp ScA pages 111-120 1992
153. Eugene M Luks Permutation groups and polynomial time computation In Finkelstein and Kantor I G Lysenok Infinite Burnside groups of even period Izv Ross Akad Nauk Ser Mat 60(3):3-224 1996
154. ID Macdonald A computer application to finite p groups J Austral Math Soc Ser A 17:102-112 1974
155. ID Macdonald Nilpotent quotient algorithms In Proceedings of Groups St Andrews 1985 volume 121 of London Math Soc Lecture Note Ser pages 268-272 Cambridge 1987 Cambridge University Press
156. New York Group Theory Cooperative at CCNY http: //wwwgrouptheoryorg/
157. Computational Algebra Group School of Mathematics and Statistics University of Sydney The Magma Computational Algebra System for Algebra Number Theory and Geometry 2004 (http://magmamathsusydeduau/magma/)
158. William S Massey A Basic Course in Algebraic Topology volume 127 of Graduate Texts in Math Springer Verlag Inc New York 1991
159. John McKay The construction of the character table of a finite group from generators and relations In Leech CF Miller III Decision problems for groups survey and reflections In G Baumslag and CF Miller III editors Algorithms and Classification in Combinatorial Group Theory volume 23 of MSRI publications pages 1 60 Springer Verlag 1992
160. Torsten Minkwitz An algorithm for solving the factorization problem in permutation groups J Symbolic Comput 26:89-95 1998
161. S Medvedoff and K Morrison Groups of perfect shuffles Math Mag 60:3-14 1987
162. M Mecky and J Neübiiser Some remarks on the computation of conjugacy classes of soluble groups Bull Austral Math Soc 40:281-292 1989
163. Jürgen Müller Max Neunhöffer Frank Röhr and Robert Wilson Completing the Brauer trees for the sporadic simple Lyons group LMS J Comput Math 5:18-33 2002
164. Scott H Murray and EA O’Brien Selecting base points for the Schreier Sims algorithm for matrix groups J Symbolic Comput 19:577-584 1995
165. G McShane J Parker and I Redfern Drawing limit sets of Kleinian groups using finite state automata Experimental Math, 3:153-172 1994
166. Gabrielle Nebe Endliche rationale Matrixgruppen vom Grad 24 volume 12 of Aachener Beitrage zur Mathematik RWTH Aachen 1995
167. J Neubiiser Untersuchungen des Untergruppenverbandes endlicher Gruppen auf einer programmgesteuerten elektronis chen Dualmaschine Numer Math, 2:280-292 1960
168. J Neubiiser Bestimmung der Untergruppenverbande endlicher />Gruppen auf einer programmgesteuerten elektronischen Dualmaschine Numer Math 3:271-278 1961
169. J Neubiiser Investigations of groups on computers In Leech J Neubiiser An elementary introduction to coset table methods in computational group theory In Groups St Andrews 1981 volume 71 of London Math Soc Lecture Note Ser pages 1-45 Cambridge 1982 Cambridge University Press
170. Peter M Neumann Some algorithms for computing with finite permutation groups In EF Robertson and CM Campbell editors Proceedings of Groups St Andrews 1985 volume 121 of London Math Soc Lecture Note Ser pages 59-92 Cambridge 1987 Cambridge University Press
171. J Neubiiser An invitation to computational group theory I11 CM Campbell TC Hurley EF Robertson SJ Tobin and JJ Ward editors Groups’93 Galway/St Andrews volume 212 of London Math Soc Lecture Note Ser pages 457-475 Cambridge University Press 1995
172. MHA Newman The influence of automatic computers on mathematical methods In Manchester University Computer Inaugural Conference pages 13-15 1951
173. MF Newman Calculating presentations for certain kinds of quotient groups In SYMSAC ’76 Proc ACM Sympos Symbolic and Algebraic Computation pages 2-8 New York 1976 (New York 1976) Association for Computing Machinery
174. MF Newman Determination of groups of prime power orderIn Group Theory volume 573 of Lecture Notes in Math pages 73-84 Berlin Heidelberg New York 1977 (Canberra 1975) Springer Verlag
175. MF Newman Proving a group infinite Arch Math 54:209-211 1990
176. Werner Nickel Endliche Korper in derri Gruppentheoretischen Programmsystem GAP Diplomarbeit RWTH Aachen 1988
177. Werner Nickel Central extensions of poly cyclic groups PhD thesis Australian National University Australian National University 1993
178. Werner Nickel Computing nilpotent quotients of finitely presented groups In G Baumslag et al editors Geometric and Computational Perspectives on Infinite Groups volume 25 of Amer Math Soc DIMACS Series pages 175-191 (DIMACS 1994) 1995
179. AC Niemeyer Constructive recognition of normalisers of small extra special matrix groups To appear in Internat J Algebra Cornput
180. Alice C Niemeyer Computing Presentations for Soluble Groups PhD thesis Australian National University 1993
181. MF Newman Werner Nickel and Alice C Niemeyer Descriptions of groups of prime power order J Symbolic Comput 25:665-682 1998
182. MF Newman and EA O’Brien Application of computers to questions like those of Burnside II Internat J Algebra Comput 6:593-605 1996
183. MF Newman and EA O’Brien Classifying 2 groups by coclass Trans Amer Math Soc 351:131-169 1999
184. Simon Norton The construction of J4 In Bruce Cooperstein and Geoffrey Mason editors Proc Santa Cruz Conference on Finite Groups pages 271 277 Arrier Math Soc 1980
185. PS Novikov On the algorithmic unsolvability of the word problem in group theory Trudy Math Inst irn Stevlov 44:1-143 1955
186. MF Newman EA O’Brien and MR Vaughan Lee Groups and nilpotent Lie rings whose order is the sixth power of a prime J Algebra 278:383-401 2004
187. Peter M Neumann and Cheryl E Praeger A recognition algorithm for special linear groups Proc London Math Soc (3) 65:555-603 1992
188. G Nebe and W Plesken Finite rational matrix groups Memoirs Arner Math Soc 116 No 556 1995
189. Alice C Niemeyer and Cheryl E Praeger A recognition algorithm for classical groups over finite fields Proc London Math Soc 77:117-169 1998
190. J Neubiiser H Pahlings and W Plesken CAS; design and use of a system for the handling of characters of finite groups In Atkinson EA O’Brien The groups of order dividing 256 Bull Austral Math Soc 39:159-160 1989
191. EA O’Brien The p group generation algorithm J Symbolic Cornput 9:677-698 1990
192. EA O’Brien The groups of order 256 J Algebra 143(1):219-235 1991
193. EA O’Brien Isomorphism testing for p groups J Symbolic Cornput 17:133-147 1994
194. J Opgenorth W Plesken and T Schulz Crystallographic algorithms and tables Acta Cryst A54:517-531 1998
195. EA O’Brien and MR Vaughan Lee The 2 generator restricted Burnside group of exponent 7 Internat J Algebra Cornput 12:575-592 2002
196. I Pak What do we know about the product replacement algorithm? In Kantor and Seress P Papasoglu Strongly geodesically automatic groups are hyperbolic Invent Math 121(2):323-334 1995
197. RA Parker The computer calculation of modular characters (the Meat Axe) In Atkinson D Passman Permutation Groups WA Benjamin New York Amsterdam 1968
198. Vera Pless Introduction to the Theory of Error Correcting Codes Wiley Interscience Series in Discrete Mathematics John Wiley Sz Sons Inc 1981
199. MF Newman EA O’Brien and MR Vaughan Lee Groups and nilpotent Lie rings whose order is the sixth power of a prime J Algebra 278:383-401 2004
200. Peter M Neumann and Cheryl E Praeger A recognition algo¬rithm for special linear groups Proa London Math Soc (3) 65:555-603 1992
201. G Nebe and W Plesken Finite rational matrix groups Memöirs Amer Math Soc 116 No 556 1995
202. Alice C Niemeyer and Cheryl E Praeger A recognition algo¬rithm for classical groups over finite fields Proc London Math Soc 77:117-169 1998
203. J Neubiiser H Pahlings and W Plesken CAS; design and use of a system for the handling of characters of finite groups In Atkinson AJE Ryba Condensation of symmetrized tensor powers J Symbolic Comput, 32:273-289 2001
204. G Sandlobes Perfect groups of order less than 104 Comm Algebra 9:477-490 1981
205. Gerhard JA Schneider Computing with endomorphism rings of modular representations J Symbolic Comput, 9:607-636 1990
206. Gerhard JA Schneider Dixon’s character table algorithm revisited J Symbolic Comput, 9:601-606 1990
207. WR Scott Group Theory Dover Publications Inc Mineola NY 1964
208. LL Scott Representations in characteristic p In Bruce Coop erstein and Geoffrey Mason editors Finite Groups volume 37 of Proc Syrnpos Pure Math, pages 319-331 Providence RI 1980 (Santa Cruz 1979) Arner Math Soc
209. Daniel Segal Polycyclic Groups Cambridge University Press Cambridge 1983
210. Dan Segal Decidable properties of polycyclic groups Proc London Math Soc (3) 61:497-528 1990
211. Akos Seress An introduction to computational group theory Notices Arner Math Soc 44:671-679 1997
212. Akos Seress Permutation Group Algorithms Cambridge Tracts in Mathematics 152 Cambridge University Press 2003
213. MW Short The Primitive Soluble Permutation Groups of Degree Less than 256 volume 1519 of Lecture Notes in Math Springer Verlag Berlin Heidelberg New York 1992
214. Igor Shparlinski Computational and Algorithmic Problems in Finite Fields volume 1519 Kluwer Academic Publishers 1992
215. Charles C Sims Computational methods in the study of permutation groups In Leech Charles C Sims Computation with permutation groups In Proc Second Syrnp on Symbolic and Algebraic Manipulation ACM Press 1971
216. Charles C Sims Determining the conjugacy classes of permutation groups In Garret Birkhoff and Marshall Hall Jr editors Computers in Algebra and Number Theory volume 4 of Proc Amer Math Soc pages 191-195 Providence RI 1971 (New York 1970) Amer Math Soc
217. Charles C Sims The existence and uniqueness of Lyons’ group In T Hagen MP Hale and EE Shult editors Finite Groups 72 pages 138-141 North Holland 1973
218. Charles C Sims Some algorithms based on coset enumeration Unpublished notes Rutgers University New Brunswick NJ 1974
219. Charles C Sims How to construct a baby monster In MJ Collins editor Finite Simple Groups II pages 339-345 (Durham 1978) Academic Press 1980
220. Charles C Sims Verifying nilpotence J Symbolic Compute 3:231-247 1987
221. Charles C Sims Computing the order of a solvable permutation group J Symbolic Cornput 9:699-705 1990
222. Charles C Sims Implementing the Baumslag Cannonito Miller polycyclic quotient algorithm J Symbolic Cornput 9:707-723 1990
223. Charles C Sims Computation with Finitely Presented Groups Cambridge University Press 1994
224. Charles C Sims Computational group theory In Computer Algebra Handbook: Foundations Applications Systems pages 65-83 Springer Verlag 2003
225. A Storjohann and G Labahn Asymptotically fast computation of Hermite normal forms of integer matrices In Proc of International Symposium on Symbolic and Algebraic Computation ISSAC ’96 pages 259-266 (Zurich) ACM Press 1996
226. LH Soicher and J McKay Computing Galois groups over the rationals J Number Theory 20:273-281 1985
227. Michael J Smith Computing automorphisms of finite soluble groups PhD thesis Australian National University 1994
228. ST Schibell and RM Stafford Processor interconnection networks and Cayley graphs Discrete Applied Mathematics 40:337-357 1992
229. M Schonert and A Seress Finding blocks of imprimitivity in small base groups in nearly linear time In Proc of International Symposium on Symbolic and Algebraic Computation ISSAC ’94 pages 154-157 (Oxford) ACM Press 1994
230. Ian Stewart and David Tall Algebraic Number Theory and Fermat’s Last Theorem AK Peters 2002
231. Arne Storjohann Computing Hermite and Smith normal forms of triangular integer matrices Linear Algebra Appl 282:25 45 1998
232. O Schirokauer D Weber and Th F Denny Discrete logarithms: the effectiveness of the index calculus method In Algorithmic Number Theory ANTS II volume 1122 of Lecture Notes in Cornput Sci pages 337-361 Berlin 1996 Springer
233. L Sylow Theorernes sur les groupes de substitutions Math Ann 5:584-594 1872
234. JA Todd and HSM Coxeter A practical method for enumerating cosets of a finite abstract group Proc Edinburgh Math Soc 5:26-34 1936
235. Heiko Theifien Eine Methode zur Normalisatorberechnung in Permutationsgruppen mit Anwendungen in der Konstruktion primitiver Gruppen PhD thesis RWTH Aachen 1997
236. H Tietze Uber die topologischen Invarianten mehrdimension alen Mannigfaltigkeiten Monatsh f Math u Physik 19:1-118 1908
237. HF Trotter A machine program for coset enumeration Canad Math Bull 7:357-368 1964
238. WR Unger Computing the solvable radical of a permutation group In preparation 2002
239. MR Vaughan Lee An aspect of the nilpotent quotient algorithm In Atkinson JW Wamsley Computing soluble groups In A Dold and BEckmann editors Group Theory volume 573 Lecture Notesin Math pages 118-125 Berlin Heidelberg New York 1977 (Canberra 1975) Springer Verlag
240. JN Ward A note on the Todd Coxeter algorithm In RABryce J Cossey and MF Newman editors Group Theory volume 573 of Lecture Notes in Mathematics pages 126-129 Berlin 1974 Springer
241. Helmut Wielandt Finite Permutation Groups Academic Press New York 1964
242. Robert A Wilson Standard generators for sporadic simple groups J Algebra 184:505-515 1996
243. Martin Wursthorn Isomorphisms of modular group algebras: an algorithm and its application to groups of order 26 J Symbolic Comput 15:211-227 1993
244. H Zassenhaus Uber einen Algorithmus zur Bestimmung der Raumgruppen Comment Math Helv 21:117-141 1948
245. EI Zel’manov Solution of the restricted Burnside problem for 2 groups (Russian) Math Sb 182:568-592 1991
246. EI Zel’manov Solution of the restricted Burnside problem for groups of odd exponent Math USSR Izv 36:41-60 1991.