On a computation of the skein tree depth of knots and links

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Jablonowski, Michal
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866909773459357696
author Jablonowski, Michal
author_facet Jablonowski, Michal
contents The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway polynomial, and more generally HOMFLY-PT polynomial). In this paper, we prove the new upper bound on the skein tree depth of a link and give examples of links where the new bound is stronger than the known bound. We also give the new lower bound. Moreover, we derive tables of knots and links with their skein tree depth that were up to now undetermined (for some of them, we give their range of possible values).
format Preprint
id arxiv_https___arxiv_org_abs_2505_15979
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On a computation of the skein tree depth of knots and links
Jablonowski, Michal
Geometric Topology
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway polynomial, and more generally HOMFLY-PT polynomial). In this paper, we prove the new upper bound on the skein tree depth of a link and give examples of links where the new bound is stronger than the known bound. We also give the new lower bound. Moreover, we derive tables of knots and links with their skein tree depth that were up to now undetermined (for some of them, we give their range of possible values).
title On a computation of the skein tree depth of knots and links
topic Geometric Topology
url https://arxiv.org/abs/2505.15979