An elementary fact about unlinked braid closures
classification
🧮 math.GT
keywords
braidfactclassicalclosureclosureselementaryfollowinghomology
read the original abstract
Let n be a positive integer. We provide a Khovanov homology proof of the following classical fact: If the closure of an n-strand braid is the n-component unlink, then the braid is trivial.
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.