Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
