Algorithms for finitely \(L\)-presented groups and their applications to some self-similar groups. (Q392149)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithms for finitely \(L\)-presented groups and their applications to some self-similar groups. |
scientific article |
Statements
Algorithms for finitely \(L\)-presented groups and their applications to some self-similar groups. (English)
0 references
13 January 2014
0 references
In the article under review, the author gives an overview of algorithms for finitely \(L\)-presented groups. As applications, using these algorithms, the author investigates the class of self-similar groups \(\Gamma_p\) for \(3\leq p\leq 11\). After recalling the notion of a self-similar group, the author demonstrates the application of his algorithms to do the following: \(\bullet\) to compute the isomorphism type of the lower central series sections \(\gamma_c\Gamma_p/\gamma_{c+1}\Gamma_p\). \(\bullet\) to compute the isomorphism type of the Dwyer quotients \(M_c(\Gamma_p)\) of their Schur multiplier. \(\bullet\) to determine the number of low-index subgroups of the groups \(\Gamma_p\). \(\bullet\) to compute the isomorphism type of the sections \(\Gamma_p^{(c)}/\Gamma_p^{(c+1)}\) of the derived series.
0 references
algorithms
0 references
Reidemeister-Schreier theorem
0 references
infinite presentations
0 references
recursive presentations
0 references
self-similar groups
0 references
finite index subgroups
0 references
finitely presented groups
0 references
finite \(L\)-presentations
0 references
nilpotent quotient algorithm
0 references
Grigorchuk group
0 references
Fabrykowski-Gupta groups
0 references
lower central series
0 references
0 references
0 references