No label defined (Q3220735)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3886105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3886105 |
Statements
1984
0 references
Todd-Coxeter Algorithm
0 references
Todd-Coxeter coset enumeration method
0 references
finitely presented group
0 references
presentation
0 references
generators
0 references
permutation representation
0 references
implementation
0 references
Reidemeister-Schreier method
0 references
performance
0 references
0 references
0 references
0 references
[For the entire collection see Zbl 0536.00004.] The so-called 'Modified Todd-Coxeter Algorithm' is a variation of the Todd-Coxeter coset enumeration method, which determines, together with the index of a subgroup H of finite index G:H in a finitely presented group \(G=<g_ 1,...,g_ n| R_ j(g_ i)>,\) a presentation of H with respect to a specified finite system \(Y=\{h_ 1,...,h_ r\}\) of generators of H which are given as words in the generators of G. The method works similarly to the well-known Todd-Coxeter method [cf. e.g. \textit{D. L. Johnson}, Topics in the theory of group presentations (1980; Zbl 0437.20026); or \textit{J. Neubüser}, Lond. Math. Soc. Lect. Note Ser. 71, 1-45 (1982; Zbl 0489.20003)]. However, rather than merely constructing the permutation representation of G on the cosets of H, coset representatives \(r_ k\) of H in G are multiplied by all \(g\in \{g_ 1,...,g_ n,\quad g_ 1^{-1},...,g_ n^{-1}\},\) yielding \(r_ kg=w_{w,g}(h_ j)\overline{r_ kg}.\) Defining relations can be obtained from these words \(w_{k,g}(h_ j)\), but the main difficulty of an implementation of this method is that these words may grow rather long. After setting the stage, the paper presents a very elegant method for dealing with this bottleneck, which intermediately introduces additional generators and relators for the subgroup in a way similar to the Reidemeister-Schreier method. Examples of the performance of an implementation are also given. It is proved that this method (when finished) has produced a presentation of H in terms of the given generators. However a warning is in place: Although this is nowhere stated, uncareful reading may - because of the formal similarity of the inductive steps of the proof and the steps used in the method - lead to the belief that at each step of the method one has a presentation for H. This is in fact not the case, at intermediate steps \(<A| R_ 1(A)>\) may describe a bigger group of which H is a homomorphic image and it is only through further use of the relations set aside in the list T, that eventually \(<Y| R_ 1(Y)>\) is a presentation of H.
0 references