Abstract
Let $n\in {\mathbb N}$. Houghton's group $H_n$ is the group of permutations of $\{1,\dotsc, n\}\times {\mathbb N}$, that eventually act as a translation in each copy of ${\mathbb N}$. We prove the solvability of the conjugacy problem and conjugator search problem for $H_n$, $n\geq 2$.
Citation
Y. Antolín. J. Burillo. A. Martino. "Conjugacy in Houghton's groups." Publ. Mat. 59 (1) 3 - 16, 2015.
Information
