1 paper
Elliot Kaplan, David Krcatovich, Patricia O'Brien
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 wo…