Polynomial algorithm for alternating link equivalence
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913882242547712 |
|---|---|
| author | Haider, Touseef Tsvietkova, Anastasiia |
| author_facet | Haider, Touseef Tsvietkova, Anastasiia |
| contents | Link equivalence up to isotopy in a 3-space is the problem that lies at the root of knot theory, and is important in 3-dimensional topology and geometry. We consider its restriction to alternating links, given by two alternating diagrams with $n_1$ and $n_2$ crossings, and show that this problem has polynomial algorithm in terms of $max\{n_1, n_2\}$. For the proof, we use Tait flyping conjectures, observations stemming from the work of Lackenby, Menasco, Sundberg and Thistlethwaite on alternating links, and algorithmic complexity of some problems from graph theory and topological graph theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_02003 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Polynomial algorithm for alternating link equivalence Haider, Touseef Tsvietkova, Anastasiia Geometric Topology 57K10, 68Q25 Link equivalence up to isotopy in a 3-space is the problem that lies at the root of knot theory, and is important in 3-dimensional topology and geometry. We consider its restriction to alternating links, given by two alternating diagrams with $n_1$ and $n_2$ crossings, and show that this problem has polynomial algorithm in terms of $max\{n_1, n_2\}$. For the proof, we use Tait flyping conjectures, observations stemming from the work of Lackenby, Menasco, Sundberg and Thistlethwaite on alternating links, and algorithmic complexity of some problems from graph theory and topological graph theory. |
| title | Polynomial algorithm for alternating link equivalence |
| topic | Geometric Topology 57K10, 68Q25 |
| url | https://arxiv.org/abs/2412.02003 |