Yago Antolín Pichel , Josep Burillo Puig , Armando Martino
Let n ∈ N. Houghton’s group Hn is the group of permutations of {1, . . . , n} × N, that eventually act as a translation in each copy of N. We prove the solvability of the conjugacy problem and conjugator search problem for Hn, n ≥ 2.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados