Related papers: The Complexity of Surjective Homomorphism Problems…

We study extensions of the Election Isomorphism problem, focused on the existence of isomorphic subelections. Specifically, we propose the Subelection Isomorphism and the Maximum Common Subelection problems and study their computational…

Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph $H$, the problem is to decide whether an input graph $G$, with each edge labeled by…

We completely classify the computational complexity of the list H-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph H the problem is either NP-complete, NL-complete, L-complete or is…

We study deformations of complex projective varieties that are homotopically or homologically trivial. We formulate several conjectures and give some examples and partial answers.

We consider the conjugacy problem for the automorphism groups of a number of countable homogeneous structures. In each case we find the precise complexity of the conjugacy relation in the sense of Borel reducibility.

Let $G$ be a graph that contains an induced subgraph $H$. A retraction from $G$ to $H$ is a homomorphism from $G$ to $H$ that is the identity function on $H$. Retractions are very well-studied: Given $H$, the complexity of deciding whether…

Focke, Goldberg, and \v{Z}ivn\'y (arXiv 2017) prove a complexity dichotomy for the problem of counting surjective homomorphisms from a large input graph G without loops to a fixed graph H that may have loops. In this note, we give a short…

This is a survey of recent and classical results concerning various types of homogeneity, such as n-homogeneity, discrete homogeneity, and countable dense homogeneity. Some new results are also presented, and several problems are posed.

The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of…

This article is dedicated to the investigation of difficulties involved in the understanding of the homomorphism concept. It doesn't restrict to group-theory but on the contrary raises the issue of developing teaching strategies aiming at…

We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.

Many natural combinatorial quantities can be expressed by counting the number of homomorphisms to a fixed relational structure. For example, the number of 3-colorings of an undirected graph $G$ is equal to the number of homomorphisms from…

We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…

This is partly a survey and partly a research article. Some known results and open problems about Kaehler groups (fundamental groups of compact Kaehler manifolds) are discussed. A new notion of Kaehler homomorphism is introduced. This is a…

This is a survey. The main subject of this survey is the homotopical or homological nature of certain structures which appear in classical problems about groups, Lie rings and group rings. It is well known that the (generalized) dimension…

At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…

There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

This survey contains the main results in rational homotopy, from the beginning to the most recent ones. It makes the status of the art, gives a short presentation of some areas where rational homotopy has been used, and contains a lot of…

Despite encouraging recent progresses in ensemble approaches, classification methods seem to have reached a plateau in development. Further advances depend on a better understanding of geometrical and topological characteristics of point…

We continue the study of the recently-introduced C123-framework, for (simple) graph problems restricted to inputs specified by the forbidding of some finite set of subgraphs, to more general graph problems possibly involving multiedges and…