Conjugacy Separability of a Class of 1-Relator Products (Q4031439)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 149109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conjugacy Separability of a Class of 1-Relator Products |
scientific article; zbMATH DE number 149109 |
Statements
Conjugacy Separability of a Class of 1-Relator Products (English)
0 references
1 April 1993
0 references
free products with amalgamation
0 references
1-relator groups
0 references
conjugacy separable groups
0 references
solvable conjugacy problem
0 references
0.91983604
0 references
0.9160799
0 references
0.8957662
0 references
0.8954182
0 references
0.8939353
0 references
0.8909872
0 references
0.88862157
0 references
0.88742954
0 references
A group \(G\) is called conjugacy separable if (and only if) to each pair \(g,h \in G\) either \(g\) is conjugate to \(h\) in \(G\) or there is a finite image of \(G\) in which the images of \(g\) and \(h\) are not conjugate. Finitely generated, conjugacy separable groups have a solvable conjugacy problem. \textit{B. Fine} and \textit{G. Rosenberger} [Contemp. Math. 109, 11-18 (1990; Zbl 0743.20045)] conjectured that the group \(G = \langle a_ 1,\dots,a_ r,b_ 1,\dots,b_ s; a^{e_ i}_ i = b^{f_ j}_ j = (UV)^ m = 1\rangle\), where \(1 \leq r\), \(1 \leq s\), \(e_ i = 0\) or \(\geq 2\), \(f_ j = 0\) or \(\geq 2\) (for all \(i\), \(j\) with \(1 \leq i \leq r\), \(1 \leq j \leq s\)), \(m \geq 2\), \(1 \neq U = U(a_ 1,\dots,a_ r)\) and \(1 \neq V = V(b_ 1,\dots,b_ s)\), is conjugacy separable. Here this conjecture is confirmed. \{Remark: The result also holds for the correspondingly defined group with \(m = 1\) and both \(U\) and \(V\) of infinite order\}.
0 references