An algorithmic definition of Gabai width

IF 0.6 3区 数学 Q3 MATHEMATICS
Ricky Lee
{"title":"An algorithmic definition of Gabai width","authors":"Ricky Lee","doi":"10.2140/agt.2023.23.2415","DOIUrl":null,"url":null,"abstract":"We define the Wirtinger width of a knot. Then we prove the Wirtinger width of a knot equals its Gabai width. The algorithmic nature of the Wirtinger width leads to an efficient technique for establishing upper bounds on Gabai width. As an application, we use this technique to calculate the Gabai width of approximately 50000 tabulated knots.","PeriodicalId":50826,"journal":{"name":"Algebraic and Geometric Topology","volume":"25 1","pages":"0"},"PeriodicalIF":0.6000,"publicationDate":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebraic and Geometric Topology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2140/agt.2023.23.2415","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We define the Wirtinger width of a knot. Then we prove the Wirtinger width of a knot equals its Gabai width. The algorithmic nature of the Wirtinger width leads to an efficient technique for establishing upper bounds on Gabai width. As an application, we use this technique to calculate the Gabai width of approximately 50000 tabulated knots.
Gabai宽度的算法定义
我们定义一个结的Wirtinger宽度。然后证明了结点的Wirtinger宽度等于它的Gabai宽度。Wirtinger宽度的算法性质导致了建立Gabai宽度上界的有效技术。作为一个应用,我们使用这种技术计算了大约50000个表列结的Gabai宽度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.10
自引率
14.30%
发文量
62
审稿时长
6-12 weeks
期刊介绍: Algebraic and Geometric Topology is a fully refereed journal covering all of topology, broadly understood.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信