37 citations · 64 across the 4 of their papers we have counts for
Showing 2014 · math.GTShow all
2 papers · 2 filters
math.GT2014
Resolution depth of positive braids
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…
math.GT2014★ 5 cited
A restriction on the Alexander polynomials of -space knots
David Krcatovich
Using an invariant defined by Rasmussen, we extend an argument given by Hedden and Watson which further restricts which Alexander polynomials can be realized by -space knots.