Are Two Given Maps Homotopic? An Algorithmic Viewpoint
Are Two Given Maps Homotopic? An Algorithmic Viewpoint
复制标题
DOI：
10.1007/s10208-019-09419-x
复制
发表时间：
2020-04-01
影响因子：
3
通讯作者：
Vokrinek, L.
中科院分区：
文献类型：
--
作者：
Filakovsky, M.;Vokrinek, L.
本文提出了两种算法。第一个决定给定单纯映射 f, g : X -> Y 之间是否存在指向同伦，第二个计算来自悬浮的映射的指向同伦类的群 [Sigma X, Y]*；在这两种情况下，目标 Y 均假设为简单连接。更一般地，这些算法相对于 X 的子集起作用。
This paper presents two algorithms. The first decides the existence of a pointed homotopy between given simplicial maps f, g : X -> Y, and the second computes the group [Sigma X, Y]* of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected. More generally, these algorithms work relative to A subset of X.