On the kinkiness of closed braids
classification
🧮 math.GT
keywords
kinkinesspositiveclosedapplicationboundbraidbraidscannot
read the original abstract
In this note, we prove a lower bound for the positive kinkiness of a closed braid which we then use to derive an estimate for the positive kinkiness of a link in terms of its Seifert system. As an application, we show that certain pretzel knots cannot be unknotted using only positive crossing changes. We also describe a subgroup of infinite rank in the smooth knot concordance group of which no element has a strongly quasipositive representative.
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.