Links, bridge number, and width trees

この論文をさがす

説明

<p>To each link 𝐿 in 𝑆3 we associate a collection of certain labelled directed trees, called width trees. We interpret some classical and new topological link invariants in terms of these width trees and show how the geometric structure of the width trees can bound the values of these invariants from below. We also show that each width tree is associated with a knot in 𝑆3 and that if it also meets a high enough “distance threshold” it is, up to a certain equivalence, the unique width tree realizing the invariants.</p>

収録刊行物

参考文献 (34)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ