Todd–Coxeter algorithm
id:
todd-coxeter-algorithm-261-7714646
title:
Todd–Coxeter algorithm
text:
In group theory, the Todd–Coxeter algorithm, created 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 algorithm enumerates the cosets of H on G and describes the permutation representation of G on the space of the cosets. If the order of a group G is relatively small and the subgroup H is known to be uncomplicated, then the algorithm can be carried out by
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Todd%E2%80%93Coxeter_algorithm
date created:
date modified:
2020-04-17T13:31:00Z
main entity:
{"identifier":"Q690505","url":"https://www.wikidata.org/entity/Q690505"}
image:
fields total:
13
integrity:
13