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...
7 KB (1,204 words) - 16:42, 28 April 2025
the Coxeter graph, Coxeter groups, Coxeter's loxodromic sequence of tangent circles, Coxeter–Dynkin diagrams, and the Todd–Coxeter algorithm. Coxeter was...
17 KB (1,693 words) - 10:05, 30 June 2025
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...
3 KB (403 words) - 04:27, 18 December 2019
and dates from a collaboration with H.S.M. Coxeter in 1936. In 1953 he and Coxeter discovered the Coxeter–Todd lattice. In 1954 he and G. C. Shephard classified...
7 KB (518 words) - 01:17, 25 April 2025
algorithms in computational group theory include: the Schreier–Sims algorithm for finding the order of a permutation group the Todd–Coxeter algorithm...
3 KB (293 words) - 18:19, 23 September 2023
finite field Schreier–Sims algorithm: computing a base and strong generating set (BSGS) of a permutation group Todd–Coxeter algorithm: Procedure for generating...
72 KB (7,951 words) - 17:13, 5 June 2025
S). The graph is useful to understand coset enumeration and the Todd–Coxeter algorithm. Coset graphs can be used to form large permutation representations...
5 KB (619 words) - 16:59, 28 April 2025
reflection groups encouraged the developments of J. A. Todd and Coxeter, such as the Todd–Coxeter algorithm in combinatorial group theory. Algebraic groups,...
32 KB (3,571 words) - 13:56, 24 June 2025
computable; other algorithms for groups may, in suitable circumstances, also solve the word problem, see the Todd–Coxeter algorithm and the Knuth–Bendix...
29 KB (4,932 words) - 01:25, 8 April 2025
Coset enumeration Schreier's subgroup lemma Schreier–Sims algorithm Todd–Coxeter algorithm Computer algebra system Cryptography Discrete logarithm Triple...
10 KB (800 words) - 23:24, 17 September 2024
Affine symmetric group (category Coxeter groups)
Coxeter groups, so the affine symmetric groups are Coxeter groups, with the s i {\displaystyle s_{i}} as their Coxeter generating sets. Each Coxeter group...
71 KB (10,250 words) - 02:22, 13 June 2025
{\displaystyle a} and z . {\displaystyle z.} In fact, the symmetric group is a Coxeter group, meaning that it is generated by elements of order 2 (the adjacent...
13 KB (2,032 words) - 18:28, 20 June 2025
fixed by a certain automorphism of order 2, and is analogous to the Coxeter–Todd lattice. The automorphism group of the Barnes–Wall lattice has order...
9 KB (2,032 words) - 07:08, 19 June 2025
generations of mathematicians, of Euler's formula for polyhedra. H.S.M. Coxeter (1973) Regular Polytopes ISBN 9780486614809, Chapter IX "Poincaré's proof...
198 KB (23,324 words) - 04:30, 6 June 2025
(link) Coxeter, H. S. M. (December 4, 1964). "Geometry". Science. New Series. 146 (3649): 1288. doi:10.1126/science.146.3649.1288. JSTOR 1714987. Todd, J...
58 KB (5,776 words) - 06:31, 12 July 2025