The computation of higher order Alexander invariants
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917071292465152 |
|---|---|
| author | Livingston, Charles |
| author_facet | Livingston, Charles |
| contents | In 1928, Alexander defined a sequence of knot polynomials, D_i(K). The first, D_1(K), is the classical Alexander polynomial. These are easily defined in terms of the homology of the infinite cyclic cover of the knot. In theory they can be computed by putting an associated Alexander matrix in Smith normal form. However, standard algorithms for computing the Smith form become impractically slow, even for some 16 crossing knots. Here, methods are developed that can effectively compute the Alexander polynomials of knots with up to 100 crossings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_07256 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The computation of higher order Alexander invariants Livingston, Charles Geometric Topology 57K10 In 1928, Alexander defined a sequence of knot polynomials, D_i(K). The first, D_1(K), is the classical Alexander polynomial. These are easily defined in terms of the homology of the infinite cyclic cover of the knot. In theory they can be computed by putting an associated Alexander matrix in Smith normal form. However, standard algorithms for computing the Smith form become impractically slow, even for some 16 crossing knots. Here, methods are developed that can effectively compute the Alexander polynomials of knots with up to 100 crossings. |
| title | The computation of higher order Alexander invariants |
| topic | Geometric Topology 57K10 |
| url | https://arxiv.org/abs/2511.07256 |