Computation of genus and braid index for renormalizable Lorenz links
We present and analyse two new algorithms to compute some combinatorial in- variants, the genus and the braid index, of renormalizable Lorenz links. We im- plement them, evaluate their complexities and compare it with the classical ones, confirming a drastic reduction of complexity.
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | bookPart |
| Idioma: | eng |
| Publicado em: |
2011
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10174/2546 |
| País: | Portugal |
| Oai: | oai:dspace.uevora.pt:10174/2546 |
| Resumo: | We present and analyse two new algorithms to compute some combinatorial in- variants, the genus and the braid index, of renormalizable Lorenz links. We im- plement them, evaluate their complexities and compare it with the classical ones, confirming a drastic reduction of complexity. |
|---|