Resolution depth of positive braids
Geometric Topology
2014-12-04 v1
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.
Cite
@article{arxiv.1412.1466,
title = {Resolution depth of positive braids},
author = {Elliot Kaplan and David Krcatovich and Patricia O'Brien},
journal= {arXiv preprint arXiv:1412.1466},
year = {2014}
}
Comments
9 pages, 6 figures