3 papers
cs.CC2023
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…
math.AT2021
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…
cs.CG2017
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…