{"title":"从缠结树对偶中得到缠结树","authors":"C. Elbracht, Jakob Kneip, Maximilian Teegen","doi":"10.4310/JOC.2022.v13.n2.a3","DOIUrl":null,"url":null,"abstract":"We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding the node degrees in them. We also present a slight strengthening and simplified proof of the duality theorem, which allows us to derive a tree-of-tangles theorem also for tangles of different orders.","PeriodicalId":44683,"journal":{"name":"Journal of Combinatorics","volume":"8 3","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2020-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Obtaining trees of tangles from tangle-tree duality\",\"authors\":\"C. Elbracht, Jakob Kneip, Maximilian Teegen\",\"doi\":\"10.4310/JOC.2022.v13.n2.a3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding the node degrees in them. We also present a slight strengthening and simplified proof of the duality theorem, which allows us to derive a tree-of-tangles theorem also for tangles of different orders.\",\"PeriodicalId\":44683,\"journal\":{\"name\":\"Journal of Combinatorics\",\"volume\":\"8 3\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2020-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4310/JOC.2022.v13.n2.a3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4310/JOC.2022.v13.n2.a3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Obtaining trees of tangles from tangle-tree duality
We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding the node degrees in them. We also present a slight strengthening and simplified proof of the duality theorem, which allows us to derive a tree-of-tangles theorem also for tangles of different orders.