Supercoiled Tangles and Stick Numbers of 2-bridge Links
classification
🧮 math.GT
keywords
bridgesticktanglescrossinglinksminimalnumberadmit
read the original abstract
Utilizing both twisting and writhing, we construct integral tangles with few sticks, leading to an efficient method for constructing polygonal 2-bridge links. Let L be a two bridge link with crossing number c, stick number s, and n tangles. It is shown that s is less than or equal to 2/3 c + 2n+3 . We also show that if c > 12n+3, then minimal stick representatives do not admit minimal crossing projections.
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.