1999
DOI: 10.1017/s0013091500019994
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for stem products and one-relator groups

Abstract: 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.1991 Mathematics subject classification: 20F05.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2000
2000
2000
2000

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…(A more efficient algorithm has been found (independently) by V. Metaftsis [11]. He uses the Bass-Serre theory of groups acting on trees to find a basis of F directly.…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…(A more efficient algorithm has been found (independently) by V. Metaftsis [11]. He uses the Bass-Serre theory of groups acting on trees to find a basis of F directly.…”
Section: Proof Of Theoremmentioning
confidence: 99%