Are Two Given Maps Homotopic? An Algorithmic Viewpoint

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F20%3A00114651" target="_blank" >RIV/00216224:14310/20:00114651 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s10208-019-09419-x" target="_blank" >https://doi.org/10.1007/s10208-019-09419-x</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10208-019-09419-x" target="_blank" >10.1007/s10208-019-09419-x</a>

Result language
angličtina
Original language name
Are Two Given Maps Homotopic? An Algorithmic Viewpoint
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GBP201%2F12%2FG028" target="_blank" >GBP201/12/G028: Eduard Čech Institute for algebra, geometry and mathematical physics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)