computational group theory

In mathematics, computational group theory is the study of groups by means of computers. It is concerned with designing and analysing algorithms and data structures to compute information about groups. The subject has attracted interest because for many interesting groups (including most of the sporadic groups) it is impractical to perform calculations by hand. Important algorithms in computational group theory include:

the Schreier-Sims algorithm for finding the order of a permutation group
the Todd-Coxeter algorithm and Knuth-Bendix algorithm for coset enumeration
the product-replacement algorithm for finding random elements of a group

Two important computer algebra systems (CAS) used for group theory are GAP and MAGMA. Historically, other systems such as CAS (for character theory) and CAYLEY (a pre-decessor of MAGMA) were important. Some achievements of the field include:

complete enumeration of all finite groups of order less than 2000
computation of representations for all the sporadic groups

<< Previous

Word Browser

Next >>

johnny fingers
cooks mills, ontario
list of bodily fluids
coulson, ontario
cove beach, ontario
creighton, ontario
kielder water
lvaro de soto
tony ianno
nancy wilson
queen's flight

kill uncle
telesoftware
sorocaba
nancy wilson (singer)
nancy wilson (guitarist)
douaumont
coset enumeration
heathkit
arnold gehlen
grandia ii
george ramsay cook

votadini
fathom five national marine park
glass bottom boat
flag of the socialist federal republic of yugoslavia
ex pfc wintergreen
british mediterranean airways
grb2
languages of the caucasus
shamshir
wilgefortis
rick stein

wally fawkes
lund cathedral
sensitive compartmented information
threading (grooming)
kleo pleyer
alliedsignal
admiral piett
low back pain
bishop of oxford
perfect circle
golden bridge