纱线球结和更快的计算

Journal of applied and computational topology Pub Date : 2023-10-28 DOI:10.1007/s41468-023-00144-7

Dror Bar-Natan, Itai Bar-Natan, Iva Halacheva, Nancy Scherich

{"title":"纱线球结和更快的计算","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":"{\"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}","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

摘要

我们利用结点和链接的三维性质，在计算结点不变量(如链接数)和一般情况下大多数有限类型不变量时，找到节省计算复杂度的方法。与使用结图的2D方法相比，节省了这些成本。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Yarn ball knots and faster computations

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊