THE CONJUGACY PROBLEM IS SOLVABLE IN FREE-BY-CYCLIC GROUPS
DOI10.1112/S0024609306018674zbMath1116.20027arXivmath/0405178MaRDI QIDQ3419065
Armando Martino, Olga Maslakova, Enric Ventura Capell, O. V. Bogopol'skij
Publication date: 6 February 2007
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0405178
algorithmsgenerating setsfree group automorphismsconjugacy problemfree-by-cyclic groupsfixed subgroupscyclic words
Automorphisms of infinite groups (20E36) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (23)
This page was built for publication: THE CONJUGACY PROBLEM IS SOLVABLE IN FREE-BY-CYCLIC GROUPS