zbMATH — the first resource for mathematics

Some results on quotients of triangle groups. (English) Zbl 0546.20027
The author studies finite permutation representations of triangle groups. He presents graphical and algorithmic computational techniques for handling them. The basic tools are coset diagrams generalizing the Cayley graph associated with a finite presentation for group \(G\). The algorithms derive from well known procedures from combinatorial group theory. The Todd-Coxeter algorithm and the Schreier-Sims algorithm provide a basis for explicit machine computation by which those finite quotients of a triangle group \(G\) are found which allow transitive permutation representations of small degree.
New results on minimal generating pairs of the groups \(A_ n\), \(S_ n\), and of the group of Rubik’s cube are given. We cite as an example: Theorem: Given \(m>6\), all but finitely many alternating groups \(A_ n\) occur as quotients of \(\Delta(2,3,m)\). Moreover, if \(m\) is even, then all but finitely many symmetric groups \(S_ n\) occur as well. Using results of Tucker, the strong symmetric genus of all \(A_ n\) and \(S_ n\) is determined. For some groups upper bounds for the genus of the group are given via minimal generating pairs and embedding some Cayley graph of \(G\) into a surface whose genus is known from the Riemann-Hurwitz equation.
Reviewer: H.R.Schneebeli

20F05 Generators, relations, and presentations of groups
20B35 Subgroups of symmetric groups
20-04 Software, source code, etc. for problems pertaining to group theory
20B25 Finite automorphism groups of algebraic, geometric, or combinatorial structures
20C30 Representations of finite symmetric groups
PDF BibTeX Cite
Full Text: DOI
[1] Coxeter, Generators and Relations for Discrete Groups (1980) · Zbl 0422.20001
[2] Conder, Bull. Inst. Math. Appl. 17 pp 241– (1981)
[3] DOI: 10.1093/qmath/32.2.137 · Zbl 0463.20029
[4] DOI: 10.1112/jlms/s2-22.1.75 · Zbl 0427.20023
[5] Biggs, Permutation Groups and Combinatorial Structures (1979) · Zbl 0415.05002
[6] Wielandt, Finite Permutation Groups (1964) · Zbl 0138.02501
[7] Dietze, Canadian J. Math. 26 pp 769– (1974) · Zbl 0271.20018
[8] DOI: 10.1016/0095-8956(83)90009-6 · Zbl 0521.05027
[9] Singmaster, Notes on Rubik’s ’Magic Cube’ (1980)
[10] Neumann, J. Austral. Math. Soc. 16 pp 1– (1973)
[11] DOI: 10.1112/blms/2.3.319 · Zbl 0206.30804
[12] DOI: 10.2307/2006317 · Zbl 0412.20013
[13] DOI: 10.2307/2006206 · Zbl 0444.20001
[14] DOI: 10.2307/1996269 · Zbl 0253.05113
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.