Bridge decompositions with distances at least two
classification
🧮 math.GT
keywords
decompositionsleastbridgedistancedistancesensurehempellinks
read the original abstract
For n-bridge decompositions of links in S^3, we propose a practical method to ensure that the Hempel distance is at least two.
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.