You are here:
Publication details
Are two H-spaces homotopy equivalent? An algorithmic view point
Authors | |
---|---|
Year of publication | 2023 |
Type | Article in Periodical |
Magazine / Source | Journal of Topology and Analysis |
MU Faculty or unit | |
Citation | |
web | https://www.worldscientific.com/doi/10.1142/S1793525323500437 |
Doi | http://dx.doi.org/10.1142/S1793525323500437 |
Keywords | Postnikov tower; Postnikov invariants; effective homological framework; algorithmic computation; homotopy equivalence problem; spaces of finite k-type; H -spaces |
Description | 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. |