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 Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/85601 |
| Acceso en línea: | https://hdl.handle.net/2117/85601 https://dx.doi.org/10.5565/PUBLMAT-59115-01 |
| Access Level: | acceso abierto |
| Palabra clave: | Group theory conjugacy problem Houghton group permutation groups Grups, Teoria de Àrees temàtiques de la UPC::Matemàtiques i estadística |
| 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 |
|---|