Resolution depth of positive braids

2014/12/03 by Kaplan, Elliot, Krcatovich, David, O'Brien, Patricia · 2 citations
#57M25 #FOS: Mathematics #Geometric Topology (math.GT)

paper · doi:10.48550/arxiv.1412.1466

Abstract

The depth of a link measures the minimum height of a resolving tree for the link whose leaves are all unlinks. We show that the depth of the closure of a strictly positive braid word is the length of the word minus the number of distinct letters.

Cited by

• Integer inequalities between knot invariants, skein tree depth and delta-crossing numbers
• On a computation of the skein tree depth of knots and links

Related

• Combinatorial distance between braid words
• Closures of positive braids and the Morton-Franks-Williams inequality
• On the signature of a positive braid
• Braids for pretzel links
• Minimum Braids: A Complete Invariant of Knots and Links