On the centralizer of generic braids
We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very particular structure. We present an algorithm to compute the centralizer of a bra...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2018 |
| País: | España |
| Recursos: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/84183 |
| Acesso em linha: | https://hdl.handle.net/11441/84183 https://doi.org/10.1515/jgth-2018-0027 |
| Access Level: | acceso abierto |
| Palavra-chave: | Generic braids |
| Resumo: | We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very particular structure. We present an algorithm to compute the centralizer of a braid whose generic-case complexity is quadratic on the length of the input, and which outputs a minimal set of generators in the generic case. |
|---|