Conjugacy in Houghton's groups
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.
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | Universitat Autònoma de Barcelona |
| Repositorio: | Dipòsit Digital de Documents de la UAB |
| Idioma: | inglés |
| OAI Identifier: | oai:ddd.uab.cat:128220 |
| Acceso en línea: | https://ddd.uab.cat/record/128220 https://dx.doi.org/urn:doi:10.5565/PUBLMAT_59115_01 |
| Access Level: | acceso abierto |
| Palabra clave: | Houghton group Permutation groups Conjugacy problem |
| Sumario: | 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. |
|---|