寻找楔形简单复合体特征映射的算法策略

Pub Date : 2021-11-14 DOI:10.2140/pjm.2022.320.13

Suyoung Choi, Mathieu Vall'ee

{"title":"寻找楔形简单复合体特征映射的算法策略","authors":"Suyoung Choi, Mathieu Vall'ee","doi":"10.2140/pjm.2022.320.13","DOIUrl":null,"url":null,"abstract":". The puzzle method was introduced by Choi and Park as an eﬀective method for ﬁnding non-singular characteristic maps over wedged simplicial complexes K ( J ) obtained from a given simplicial complex K . We study further the mod 2 case of the puzzle method. We ﬁrstly describe it completely in terms of linear algebraic language which allows us to develop a constructive puzzle algorithm. We also analyze our algorithm and compare its performances with other known algorithms including the Garrison and Scott algorithm.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An algorithmic strategy for finding characteristic maps over wedged simplicial complexes\",\"authors\":\"Suyoung Choi, Mathieu Vall'ee\",\"doi\":\"10.2140/pjm.2022.320.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". The puzzle method was introduced by Choi and Park as an eﬀective method for ﬁnding non-singular characteristic maps over wedged simplicial complexes K ( J ) obtained from a given simplicial complex K . We study further the mod 2 case of the puzzle method. We ﬁrstly describe it completely in terms of linear algebraic language which allows us to develop a constructive puzzle algorithm. We also analyze our algorithm and compare its performances with other known algorithms including the Garrison and Scott algorithm.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2021-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2140/pjm.2022.320.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2140/pjm.2022.320.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

Choi和Park引入了谜题方法，将其作为在从给定的单纯复形K获得的楔形单纯复形K（J）上确定非奇异特征映射的有效方法。我们进一步研究了拼图方法的mod 2情况。我们首先用线性代数语言对其进行了完整的描述，这使我们能够开发出一种构造性的谜题算法。我们还分析了我们的算法，并将其性能与包括Garrison和Scott算法在内的其他已知算法进行了比较。

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

查看原文

An algorithmic strategy for finding characteristic maps over wedged simplicial complexes

. The puzzle method was introduced by Choi and Park as an eﬀective method for ﬁnding non-singular characteristic maps over wedged simplicial complexes K ( J ) obtained from a given simplicial complex K . We study further the mod 2 case of the puzzle method. We ﬁrstly describe it completely in terms of linear algebraic language which allows us to develop a constructive puzzle algorithm. We also analyze our algorithm and compare its performances with other known algorithms including the Garrison and Scott algorithm.

求助全文

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