Article contents
Subgroup Separability of Generalized Free Products of Free-By-Finite Groups
Published online by Cambridge University Press: 20 November 2018
Abstract
We prove that generalized free products of finitely generated free-byfinite groups amalgamating a cyclic subgroup are subgroup separable. From this it follows that if where t ≥ 1 and u, v are words on {a1,...,am} and {b1,...,bn} respectively then G is subgroup separable thus generalizing a result in [9] that such groups have solvable word problems.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1993
References
- 5
- Cited by