{"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 effective method for finding 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 firstly 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":54651,"journal":{"name":"Pacific Journal of Mathematics","volume":" ","pages":""},"PeriodicalIF":0.7000,"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 effective method for finding 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 firstly 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\":54651,\"journal\":{\"name\":\"Pacific Journal of Mathematics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2021-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Pacific Journal of Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2140/pjm.2022.320.13\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pacific Journal of Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2140/pjm.2022.320.13","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
An algorithmic strategy for finding characteristic maps over wedged simplicial complexes
. The puzzle method was introduced by Choi and Park as an effective method for finding 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 firstly 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.
期刊介绍:
Founded in 1951, PJM has published mathematics research for more than 60 years. PJM is run by mathematicians from the Pacific Rim. PJM aims to publish high-quality articles in all branches of mathematics, at low cost to libraries and individuals. The Pacific Journal of Mathematics is incorporated as a 501(c)(3) California nonprofit.