Computing with Abelian Sections of Finitely Presented Groups
β Scribed by Derek F. Holt; Sarah Rees
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 100 KB
- Volume
- 214
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
Let G be a finitely presented group. This paper describes the theory and practice of a method for obtaining information about the finite and abelian-by-finite quotients of G, which often allows computation about larger quotients of the group than has been possible by more traditional methods. The paper also describes the authors' software package quotpic, which provides a user-friendly implementation of the algorithms involved in this method, as part of a complete range of facilities for computing various types of quotients of finitely presented groups.
π SIMILAR VOLUMES
We show that if β« is a finitely presented normal subgroup of a product G = G 1 2 of Fuchsian groups which projects nontrivially to each factor, then β« has finite index in G = G . The proof uses the author's previous reduction of the descrip-1 2 tion of normal subdirect products to the abelian case
A sufficient condition is obtained for the residual torsion-free nilpotence of certain finitely presented metabelian groups that arise from a matrix representa-Ε½ . tion developed by Magnus 1939, Ann. of Math. 40, 764α768 for metabelian Ε½ groups. Using this condition and a construction due to Baumsla
## Abstract We find all possible lengths of circuits in Cayley digraphs of twoβgenerated abelian groups over the twoβelement generating sets and over certain threeβelement generating sets.