Twisted conjugacy in braid groups
In this note we solve the twisted conjugacy problem for braid groups, i.e. we propose an algorithm which, given two braids u, v ∈ Bn and an automorphism ϕ ∈ Aut(Bn), decides whether v = (ϕ(x))−1ux for some x ∈ Bn. As a corollary, we deduce that each group of the form Bn o H, a semidirect product of...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2014 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/41164 |
| Acceso en línea: | http://hdl.handle.net/11441/41164 https://doi.org/10.1007/s11856-014-0032-4 |
| Access Level: | acceso abierto |
| Palabra clave: | Braid group twisted conjugacy |
| Sumario: | In this note we solve the twisted conjugacy problem for braid groups, i.e. we propose an algorithm which, given two braids u, v ∈ Bn and an automorphism ϕ ∈ Aut(Bn), decides whether v = (ϕ(x))−1ux for some x ∈ Bn. As a corollary, we deduce that each group of the form Bn o H, a semidirect product of the braid group Bn by a torsion-free hyperbolic group H, has solvable conjugacy problem. |
|---|