Abstract:
In the paper, the solvability of the word problem and the conjugacy problem is proved for a wide class of finitely presented groups defined by periodic defining relations of a sufficiently large odd degree. In the proof, we use a certain simplified version of the classification of periodic words and transformations of these words, which was presented in detail in the author's monograph devoted to the well-known Burnside problem. The result is completed with the proof of an interesting result of Sarkisyan on the existence of a group, given by defining relations of the form E2i=1, for which the word problem is unsolvable. This result was first published in abstracts of papers of the 13th All-Union Algebra Symposium in Gomel in 1975.
Keywords:
finitely presented group, periodic defining relations, unsolvable conjugacy problem, unsolvable word problem, reduced word.
S. I. Adian, “New estimates of odd exponents of infinite Burnside groups”, Proc. Steklov Inst. Math., 289 (2015), 33–71
Mahim Jain, ChitraS Nayak, Ramaya Chokkar, Rashmi Aderao, “Clinical, bacteriological, and histopathological characteristics of children with leprosy: A retrospective, analytical study in dermatology outpatient department of tertiary care centre”, Indian J Paediatr Dermatol, 15:1 (2014), 16
S. I. Adian, “The Burnside problem and related topics”, Russian Math. Surveys, 65:5 (2010), 805–855
CYBÈLE A. RENAULT, JOEL D. ERNST, Mandell, Douglas, and Bennett's Principles and Practice of Infectious Diseases, 2010, 3165
Vanaja Prabhaker Shetty, “Challenges Facing the Control of Leprosy in the Indian Context”, Ann Acad Med Singap, 39:1 (2010), 1