Algorithmic solvability of the lifting-extension problem

Martin Čadek, Marek Krčál, Lukáš Vokřínek

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$. Assuming that $Y$ is $d$-connected…