Resolution depth of positive braids

DOI10.1142/S0218216515500753zbMATH Open1331.57007arXiv1412.1466OpenAlexW2963578689MaRDI QIDQ3465795FDOQ3465795

Authors: Elliot Kaplan, David Krcatovich, Patricia O'Brien 

Publication date: 22 January 2016

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1412.1466

Recommendations

• Positive braids of maximal signature
• Fixed points for positive permutation braids
• Bijective combinatorics of positive braids
• Khovanov width and dealternation number of positive braid links
• Signature spectrum of positive braids
• Gordian Adjacency for Positive Braid Knots
• ALGORITHMS FOR POSITIVE BRAIDS
• Factoring positive braids via branched manifolds
• The volume of positive braid links
• On positive braids motivated by Rossler dynamical system

zbMATH Keywords

resolution depthresolution treeskein tree

Mathematics Subject Classification ID

Cites Work

• Link genus and the Conway moves
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Thurston Norm Minimizing Surfaces and Skein Trees for Links in S 3

This page was built for publication: Resolution depth of positive braids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465795)