Article contents
An algorithm for stem products and one-relator groups
Published online by Cambridge University Press: 20 January 2009
Extract
We give an algorithm which for a given set of generators can decide whether a stem product of infinite cyclic groups is a one-relator group. We also generalize this to the case of one-relator products of groups.
- Type
- Research Article
- Information
- Proceedings of the Edinburgh Mathematical Society , Volume 42 , Issue 1 , February 1999 , pp. 37 - 42
- Copyright
- Copyright © Edinburgh Mathematical Society 1999
References
REFERENCES
- 1
- Cited by