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.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | bookPart |
| Language: | eng |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10174/2546 |
| Country: | Portugal |
| Oai: | oai:dspace.uevora.pt:10174/2546 |
| Summary: | 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. |
|---|