The number of strings on essential tangle decompositions of a knot can be unbounded
classification
🧮 math.GT
keywords
decompositionsessentialknottanglearbitrarilycollectionconstructfamily
read the original abstract
We construct an infinite collection of knots with the property that any knot in this family has $n$-string essential tangle decompositions for arbitrarily high $n$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.