{"title":"Yarn ball knots and faster computations","authors":"Dror Bar-Natan, Itai Bar-Natan, Iva Halacheva, Nancy Scherich","doi":"10.1007/s41468-023-00144-7","DOIUrl":null,"url":null,"abstract":"Abstract We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison with the 2D approach to knots using knot diagrams.","PeriodicalId":73600,"journal":{"name":"Journal of applied and computational topology","volume":"19 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of applied and computational topology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s41468-023-00144-7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison with the 2D approach to knots using knot diagrams.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
