Showing 2025Show all
2 papers · 1 filter
math.GT2025
Integer inequalities between knot invariants, skein tree depth and delta-crossing numbers
Michal Jablonowski
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 rel…
math.GT2025
On a computation of the skein tree depth of knots and links
Michal Jablonowski
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 rel…