两个h空间是否等价?一个算法的观点

IF 0.5 3区数学 Q3 MATHEMATICS

Journal of Topology and Analysis Pub Date : 2023-11-10 DOI:10.1142/s1793525323500437

Maria Simkova

{"title":"两个h空间是否等价?一个算法的观点","authors":"Maria Simkova","doi":"10.1142/s1793525323500437","DOIUrl":null,"url":null,"abstract":"This paper proposes an algorithm that decides if two simply connected spaces represented by finite simplicial sets of finite $k$-type and finite dimension $d$ are homotopy equivalent. If the spaces are homotopy equivalent, the algorithm finds a homotopy equivalence between their Postnikov stages in dimension $d$. As a consequence, we get an algorithm deciding if two spaces represented by finite simplicial sets are stably homotopy equivalent.","PeriodicalId":49151,"journal":{"name":"Journal of Topology and Analysis","volume":" July","pages":"0"},"PeriodicalIF":0.5000,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Are two <i>H</i>-Spaces Homotopy Equivalent? An Algorithmic View Point\",\"authors\":\"Maria Simkova\",\"doi\":\"10.1142/s1793525323500437\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an algorithm that decides if two simply connected spaces represented by finite simplicial sets of finite $k$-type and finite dimension $d$ are homotopy equivalent. If the spaces are homotopy equivalent, the algorithm finds a homotopy equivalence between their Postnikov stages in dimension $d$. As a consequence, we get an algorithm deciding if two spaces represented by finite simplicial sets are stably homotopy equivalent.\",\"PeriodicalId\":49151,\"journal\":{\"name\":\"Journal of Topology and Analysis\",\"volume\":\" July\",\"pages\":\"0\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Topology and Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s1793525323500437\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Topology and Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s1793525323500437","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

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

查看原文本刊更多论文

Are two H-Spaces Homotopy Equivalent? An Algorithmic View Point

This paper proposes an algorithm that decides if two simply connected spaces represented by finite simplicial sets of finite $k$-type and finite dimension $d$ are homotopy equivalent. If the spaces are homotopy equivalent, the algorithm finds a homotopy equivalence between their Postnikov stages in dimension $d$. As a consequence, we get an algorithm deciding if two spaces represented by finite simplicial sets are stably homotopy equivalent.

求助全文

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

来源期刊

Journal of Topology and Analysis MATHEMATICS-

CiteScore

1.50

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： This journal is devoted to topology and analysis, broadly defined to include, for instance, differential geometry, geometric topology, geometric analysis, geometric group theory, index theory, noncommutative geometry, and aspects of probability on discrete structures, and geometry of Banach spaces. We welcome all excellent papers that have a geometric and/or analytic flavor that fosters the interactions between these fields. Papers published in this journal should break new ground or represent definitive progress on problems of current interest. On rare occasion, we will also accept survey papers.