 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 productreplacement 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 predecessor 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
References
 A survey of the subject by Ákos Seress from Ohio State University, expanded from an article that appeared in the Notices of the American Mathematical Society is available online. There is also a survey by Charles Sims from Rutgers University and an older survey by Joachim Neubüser from RWTH Aachen.
There are three books covering various parts of the subject:
 Derek F. Holt, Bettina Eick, Bettina, Eamonn A. O'Brien, "Handbook of computational group theory", Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, FL, 2005. ISBN 1584883723
 Charles C. Sims, "Computation with Finitelypresented Groups", Encyclopedia of Mathematics and its Applications, vol 48, Cambridge University Press, Cambridge, 1994. ISBN 0521432138
 Ákos Seress, "Permutation group algorithms", Cambridge Tracts in Mathematics, vol. 152, Cambridge University Press, Cambridge, 2003. ISBN 052166103X.
Categories:
Wikimedia Foundation. 2010.
Look at other dictionaries:
Geometric group theory — is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such groups and topological and geometric properties of spaces on which these groups act (that is, when the… … Wikipedia
Base (group theory) — Let G be a finite permutation group acting on a set Omega. A sequence :B = [eta 1,eta 2,...,eta k] of k distinct elements of Omega is a base for G if the only element of G which fixes every eta i in B pointwise is the identity element of G.We … Wikipedia
List of group theory topics — Contents 1 Structures and operations 2 Basic properties of groups 2.1 Group homomorphisms 3 Basic types of groups … Wikipedia
History of group theory — The history of group theory, a mathematical domain studying groups in their various forms, has evolved in various parallel threads. There are three historical roots of group theory: the theory of algebraic equations, number theory and geometry.… … Wikipedia
Computational — may refer to: Computer Computational algebra Computational Aeroacoustics Computational and Information Systems Laboratory Computational and Systems Neuroscience Computational archaeology Computational auditory scene analysis Computational biology … Wikipedia
Group (mathematics) — This article covers basic notions. For advanced topics, see Group theory. The possible manipulations of this Rubik s Cube form a group. In mathematics, a group is an algebraic structure consisting of a set together with an operation that combines … Wikipedia
Computational geometry — is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to… … Wikipedia
Computational topology — Algorithmic topology, or computational topology, is a subfield of topology with an overlap with areas of computer science, in particular computational geometry and computational complexity theory. A primary concern of algorithmic topology, as its … Wikipedia
Computational informatics — Informatics is the academic field concerned with the study of the foundations, theory, structure, communication, and use of information. Computational informatics, as a subfield of informatics, studies information using computational… … Wikipedia
Computational complexity of mathematical operations — The following tables list the running time of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine.[1] See big O notation for an explanation … Wikipedia