20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Todd-Coxeter Algorithm: J. A. Todd, Group Theory, H.S.M. Coxeter, Algorithm, Coset Enumeration, Permutation Representation -

English
2026-03-19
€156.58 €195.73

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

High Quality Content by WIKIPEDIA articles! 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 algorithm enumerates the cosets of H on G and describes the permutation representation of G on the space of the cosets. I ... Full description

You May Also Like

Description

High Quality Content by WIKIPEDIA articles! 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 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 (for example, a cyclic group), then the algorithm can be carried out by hand and gives a reasonable description of the group G. Using their algorithm, Coxeter and Todd showed that certain systems of relations between generators of known groups are complete, i.e. constitute systems of defining relations.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131147876
Write Your Own Review
You're reviewing: Todd-Coxeter Algorithm: J. A. Todd, Group Theory, H.S.M. Coxeter, Algorithm, Coset Enumeration, Permutation Representation
Your Rating:

Goodreads Reviews

€156.58 €195.73