{"title":"An unoriented skein relation via bordered–sutured Floer homology","authors":"D. Vela-Vick, C.-M. Michael Wong","doi":"10.4310/jsg.2021.v19.n6.a4","DOIUrl":null,"url":null,"abstract":"We show that the bordered-sutured Floer invariant of the complement of a tangle in an arbitrary 3-manifold $Y$, with minimal conditions on the bordered-sutured structure, satisfies an unoriented skein exact triangle. This generalizes a theorem by Manolescu for links in $S^3$. We give a theoretical proof of this result by adapting holomorphic polygon counts to the bordered-sutured setting, and also give a combinatorial description of all maps involved and explicitly compute them. We then show that, for $Y = S^3$, our exact triangle coincides with Manolescu's. Finally, we provide a graded version of our result, explaining in detail the grading reduction process involved.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4310/jsg.2021.v19.n6.a4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We show that the bordered-sutured Floer invariant of the complement of a tangle in an arbitrary 3-manifold $Y$, with minimal conditions on the bordered-sutured structure, satisfies an unoriented skein exact triangle. This generalizes a theorem by Manolescu for links in $S^3$. We give a theoretical proof of this result by adapting holomorphic polygon counts to the bordered-sutured setting, and also give a combinatorial description of all maps involved and explicitly compute them. We then show that, for $Y = S^3$, our exact triangle coincides with Manolescu's. Finally, we provide a graded version of our result, explaining in detail the grading reduction process involved.