Algorithmic Solvability of the Lifting-Extension Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10364806" target="_blank" >RIV/00216208:11320/17:10364806 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14310/17:00094956
Result on the web
<a href="http://dx.doi.org/10.1007/s00454-016-9855-6" target="_blank" >http://dx.doi.org/10.1007/s00454-016-9855-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00454-016-9855-6" target="_blank" >10.1007/s00454-016-9855-6</a>

Result language
angličtina
Original language name
Algorithmic Solvability of the Lifting-Extension Problem
Original language description
Let X and Y be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group G. We provide an algorithm that computes the set of all equivariant homotopy classes of equivariant continuous maps. More generally, we present an algorithm that, given a lifting-extension problem satisfying an appropriate stability assumption, computes the set of all homotopy classes of solutions. This result is new even in the non-equivariant situation.
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
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)