arXiv subjects
Publications and source records attributed to Mária Šimková.
This article proposes an algorithm that constructs a Sullivan minimal model for any simply connected simplicial set with effective homology and thereby allows one to decide algorithmically whether two simply connected spaces represented by finite simplicial sets have the same rational homotopy type.
This paper investigates sufficient and necessary conditions for the existence of a homotopy equivalence between two finite simplicial complexes from an algorithmic point of view. As a result, the conditions are formulated in terms of the underlying data of Postnikov towers for simplicial sets with so-called effective homology.
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.