# Coset enumeration

﻿
Coset enumeration

In mathematics, coset enumeration is the problem of counting the cosets of a subgroup H of a group G given in terms of a presentation. As a by-product, one obtains a permutation representation for G on the cosets of H. If H has a known finite order, coset enumeration gives the order of G as well.

For small groups it is sometimes possible to perform a coset enumeration by hand. However, for large groups it is time-consuming and error-prone, so it is usually carried out by computer. Coset enumeration is usually considered to be one of the fundamental problems in computational group theory.

The original algorithm for coset enumeration was invented by John Arthur Todd and H. S. M. Coxeter. Various improvements to the original Todd–Coxeter algorithm have been suggested, notably the classical strategies of V. Felsch and HLT (Haselgrove, Leech and Trotter). A practical implementation of these strategies with refinements is available at the ACE website. The Knuth–Bendix algorithm also can perform coset enumeration, and unlike the Todd–Coxeter algorithm, it can sometimes solve the word problem for infinite groups.

The main practical difficulties in producing a coset enumerator are that it is difficult or impossible to predict how much memory or time will be needed to complete the process. If a group is finite, then its coset enumeration must terminate eventually, although it may take arbitrarily long and use an arbitrary amount of memory, even if the group is trivial. Depending on the algorithm used, it may happen that making small changes to the presentation that do not change the group nevertheless have a large impact on the amount of time or memory needed to complete the enumeration. These behaviours are a consequence of the unsolvability of the word problem for groups.

A gentle introduction to coset enumeration is given in Rotman's text on group theory. More detailed information on correctness, efficiency, and practical implementation can be found in the books by Sims and Holt et al.

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Coset — In mathematics, if G is a group, and H is a subgroup of G, and g is an element of G, then gH = {gh : h an element of H } is a left coset of H in G, and Hg = {hg : h an element of H } is a right coset of H in G. Only when H is normal… …   Wikipedia

• Todd–Coxeter algorithm — In group theory, the Todd–Coxeter algorithm, discovered by J.A. Todd and H.S.M. Coxeter in 1936, is an algorithm for solving the coset enumeration problem. Given a presentation of a group G by generators and relations and a subgroup H of G , the… …   Wikipedia

• List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

• Cayley graph — In mathematics, the Cayley graph, also known as the Cayley colour graph, is the graph that encodes the structure of a discrete group. Its definition is suggested by Cayley s theorem (named after Arthur Cayley) and uses a particular, usually… …   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

• 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… …   Wikipedia

• J. A. Todd — Infobox Scientist | name = John Arthur Todd | caption = | birth date = birth date|1908|8|23|df=y | birth place = Liverpool, England | residence = UK | nationality = English | death date = death date and age|1994|12|22|1908|8|23|df=y | death place …   Wikipedia

• Schur multiplier — In mathematical group theory, the Schur multiplier or Schur multiplicator is the second homology group of a group G. It was introduced by Issai Schur (1904) in his work on projective representations. Contents 1 Examples and properties 2 Re …   Wikipedia

• Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… …   Wikipedia