Conjugacy in Houghton's Groups

Abstract

Let $n\in \mathbb{N}$. Houghton's group $H_n$ is the group of permutations of $\{1,\dots ,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\ge 2$.

arXiv comment11 pages, 1 figure, v2 correct typos and fills a small gap in the argument

References in corpus (1)

• Geometry of Houghton's Groups

Cited by in corpus (1)

• The $R_{\infty }$ property for Houghton's groups