On the word problem for groups defined by periodic relations (Q3881014)
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 3685735
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the word problem for groups defined by periodic relations |
scientific article; zbMATH DE number 3685735 |
Statements
On the word problem for groups defined by periodic relations (English)
0 references
1980
0 references
word problem
0 references
0.9486607
0 references
0 references
0.8928182
0 references
0.8903849
0 references
0.88929456
0 references
0.88842297
0 references
0.8872835
0 references
Using the methods developed in his book [The Burnside problem and identities in groups. Berlin etc.: Springer-Verlag (1979; Zbl 0417.20001)], the author outlines a proof of the following result: Let \(n\) be an odd integer \(>665\) and \(G=\langle a_1, \dots, a_n; A_1^n, \dots, A_k^n\rangle\) have no elements of order 2. Then the word problem is solvable in \(G\). Further, it is shown that if the defining relations are not finite, then there exists a group of this form which has unsolvable word problem. For the entire collection see Zbl 0424.00008.
0 references