4 papers
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
Marek Filakovský, Tamio-Vesa Nakajima, Jakub Opršal +2
A linearly ordered (LO) -colouring of a hypergraph is a colouring of its vertices with colours such that each edge contains a unique maximal colour. Deciding wheth…
Computing homotopy classes for diagrams
Marek Filakovský, Lukáš Vokřínek
We present an algorithm that, given finite simplicial sets , , with an action of a finite group , computes the set of homotopy classes of equivariant maps…
Computing simplicial representatives of homotopy group elements
Marek Filakovsky, Peter Franek, Uli Wagner +1
A central problem of algebraic topology is to understand the homotopy groups of a topological space . For the computational version of the problem, it is well known tha…
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…