Conjugacy problem in a class of \(2\)-groups

DOI10.1007/BF02314631zbMath0942.20011OpenAlexW2070314356MaRDI QIDQ1290795

Yuriy G. Leonov

Publication date: 13 August 2000

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02314631

zbMATH Keywords

wreath productsconjugacy problemGrigorchuk \(2\)-groups

Mathematics Subject Classification ID

Conjugacy classes for groups (20E45) Periodic groups; locally finite groups (20F50) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

Unnamed Item, Key agreement based on automaton groups, On the closure of the first Grigorchuk group., The conjugacy problem in automaton groups is not solvable., Log-space conjugacy problem in the Grigorchuk group, The conjugacy problem in the Grigorchuk group is polynomial time decidable., Linear time algorithm for the conjugacy problem in the first Grigorchuk group, Ramification structures for quotients of the Grigorchuk groups

Cites Work

• Unnamed Item
• On Burnside's problem on periodic groups
• Conjugacy separability of certain torsion groups