Knowledge (XXG)

Computational group theory

Source 📝

25: 258:
Derek F. Holt, Bettina Eick, Eamonn A. O'Brien, "Handbook of computational group theory", Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, Florida, 2005.
54: 227: 311: 306: 285:Ákos Seress, "Permutation group algorithms", Cambridge Tracts in Mathematics, vol. 152, Cambridge University Press, Cambridge, 2003. 290: 280: 263: 76: 109:
to compute information about groups. The subject has attracted interest because for many interesting groups (including most of the
219: 173: 165: 235: 121: 37: 161: 139: 135: 47: 41: 33: 272: 149: 58: 157: 271:, "Computation with Finitely-presented Groups", Encyclopedia of Mathematics and its Applications, vol 48, 223: 190: 184: 125: 98: 243: 239: 286: 276: 259: 143: 129: 231: 169: 268: 206: 194: 110: 106: 300: 247: 90: 102: 101:
by means of computers. It is concerned with designing and analysing
18: 254:
There are three books covering various parts of the subject:
116:
Important algorithms in computational group theory include:
113:) it is impractical to perform calculations by hand. 16:Study of mathematical groups by means of computers 226:, expanded from an article that appeared in the 46:but its sources remain unclear because it lacks 168:. Historically, other systems such as CAS (for 8: 228:Notices of the American Mathematical Society 185:all finite groups of order less than 2000 176:(a predecessor of Magma) were important. 77:Learn how and when to remove this message 179:Some achievements of the field include: 152:for finding random elements of a group 230:is available online. There is also a 7: 222:of the subject by Ákos Seress from 14: 160:(CAS) used for group theory are 23: 1: 312:Computational fields of study 150:product-replacement algorithm 328: 307:Computational group theory 273:Cambridge University Press 95:computational group theory 246:by Joachim NeubĂźser from 183:complete enumeration of 158:computer algebra systems 32:This article includes a 122:Schreier–Sims algorithm 61:more precise citations. 140:Knuth–Bendix algorithm 136:Todd–Coxeter algorithm 224:Ohio State University 275:, Cambridge, 1994. 240:Rutgers University 34:list of references 144:coset enumeration 130:permutation group 87: 86: 79: 319: 170:character theory 124:for finding the 97:is the study of 82: 75: 71: 68: 62: 57:this article by 48:inline citations 27: 26: 19: 327: 326: 322: 321: 320: 318: 317: 316: 297: 296: 269:Charles C. Sims 215: 207:Black box group 203: 195:sporadic groups 191:representations 189:computation of 111:sporadic groups 107:data structures 83: 72: 66: 63: 52: 38:related reading 28: 24: 17: 12: 11: 5: 325: 323: 315: 314: 309: 299: 298: 295: 294: 283: 266: 252: 251: 214: 211: 210: 209: 202: 199: 198: 197: 187: 156:Two important 154: 153: 146: 132: 85: 84: 42:external links 31: 29: 22: 15: 13: 10: 9: 6: 4: 3: 2: 324: 313: 310: 308: 305: 304: 302: 292: 291:0-521-66103-X 288: 284: 282: 281:0-521-43213-8 278: 274: 270: 267: 265: 264:1-58488-372-3 261: 257: 256: 255: 249: 245: 241: 237: 233: 229: 225: 221: 217: 216: 212: 208: 205: 204: 200: 196: 192: 188: 186: 182: 181: 180: 177: 175: 171: 167: 163: 159: 151: 147: 145: 141: 137: 133: 131: 127: 123: 119: 118: 117: 114: 112: 108: 104: 100: 96: 92: 81: 78: 70: 60: 56: 50: 49: 43: 39: 35: 30: 21: 20: 253: 244:older survey 236:Charles Sims 193:for all the 178: 155: 115: 94: 88: 73: 67:January 2020 64: 53:Please help 45: 248:RWTH Aachen 91:mathematics 59:introducing 301:Categories 213:References 103:algorithms 201:See also 242:and an 55:improve 289:  279:  262:  232:survey 220:survey 174:Cayley 172:) and 99:groups 238:from 166:Magma 128:of a 126:order 40:, or 287:ISBN 277:ISBN 260:ISBN 164:and 148:the 142:for 138:and 134:the 120:the 105:and 234:by 162:GAP 89:In 303:: 218:A 93:, 44:, 36:, 293:. 250:. 80:) 74:( 69:) 65:( 51:.

Index

list of references
related reading
external links
inline citations
improve
introducing
Learn how and when to remove this message
mathematics
groups
algorithms
data structures
sporadic groups
Schreier–Sims algorithm
order
permutation group
Todd–Coxeter algorithm
Knuth–Bendix algorithm
coset enumeration
product-replacement algorithm
computer algebra systems
GAP
Magma
character theory
Cayley
all finite groups of order less than 2000
representations
sporadic groups
Black box group
survey
Ohio State University

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑