activity
20112021
most citedPolynomial-time computation of homotopy groups and Postnikov systems in fixed dimension

31 citations · 45 across the 4 of their papers we have counts for

collaborators
Showing 2013 · math.ATShow all

2 papers · 2 filters

math.AT2013

Are two given maps homotopic? An algorithmic viewpoint

Marek Filakovský, Lukáš Vokřínek

This paper presents two algorithms. In their simplest form, the first algorithm decides the existence of a pointed homotopy between given simplicial maps f, g from X to Y and the s…

math.AT2013

Algorithmic solvability of the lifting-extension problem

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

Let and be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group . Assuming that is -connected…