Related papers: Homomorphism Extension

A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective if its restriction to the neighborhood of every vertex of G is bijective, surjective, or injective, respectively. We prove that the problems of…

For a fixed graph $H$, the reconfiguration problem for $H$-colourings (i.e. homomorphisms to $H$) asks: given a graph $G$ and two $H$-colourings $\varphi$ and $\psi$ of $G$, does there exist a sequence $f_0,\dots,f_m$ of $H$-colourings such…

We introduce the concept of homotopy equivalence for Hopf Galois extensions and make a systematic study of it. As an application we determine all H-Galois extensions up to homotopy equivalence in the case when H is a Drinfeld-Jimbo quantum…

We investigate conditions for the extendibility of continuous algebra homomorphisms $\phi$ from the Fourier algebra $A(F)$ of a locally compact group $F$ to the Fourier-Stieltjes algebra $B(G)$ of a locally compact group $G$ to maps between…

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…

Given graphs $H$ and $G$, possibly with vertex-colors, a homomorphism is a function $f:V(H)\to V(G)$ that preserves colors and edges. Many interesting counting problems (e.g., subgraph and induced subgraph counts) are finite linear…

We revisit the algorithmic problem of reconstructing a graph from homomorphism counts that has first been studied in (B\"oker et al., STACS 2024): given graphs $F_1,\ldots,F_k$ and counts $m_1,\ldots,m_k$, decide if there is a graph $G$…

Counting problems in general and counting graph homomorphisms in particular have numerous applications in combinatorics, computer science, statistical physics, and elsewhere. One of the most well studied problems in this area is…

We study the problem of computing the parity of the number of homomorphisms from an input graph $G$ to a fixed graph $H$. Faben and Jerrum [ToC'15] introduced an explicit criterion on the graph $H$ and conjectured that, if satisfied, the…

Let $A \leq G$ be a subgroup of a group $G$. An $A$-complement of $G$ is a subgroup $H$ of $G$ such that $G = A H$ and $A \cap H = \{1\}$. The \emph{classifying complements problem} asks for the description and classification of all…

Let $\mathfrak{L}$ be a Leibniz algebra, $E$ a vector space and $\pi : E \to \mathfrak{L}$ an epimorphism of vector spaces with $ \mathfrak{g} = {\rm Ker} (\pi)$. The global extension problem asks for the classification of all Leibniz…

We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…

For graphs $G$ and $H$, a mapping $f: V(G)\dom V(H)$ is a homomorphism of $G$ to $H$ if $uv\in E(G)$ implies $f(u)f(v)\in E(H).$ If, moreover, each vertex $u \in V(G)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of the…

This paper surveys, and in some cases generalises, many of the recent results on homomorphisms and the higher Ext groups for q-Schur algebras and for the Hecke algebra of type A. We review various results giving isomorphisms between Ext…

For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…

Counting the number of homomorphisms of a pattern graph H in a large input graph G is a fundamental problem in computer science. There are myriad applications of this problem in databases, graph algorithms, and network science. Often, we…

This paper investigates ways to enlarge the Hamiltonian subgroup Ham of the symplectomorphism group Symp(M) of the symplectic manifold (M, \omega) to a group that both intersects every connected component of Symp(M) and characterizes…

We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…

We continue the program of systematic study of extended HOMFLY polynomials. Extended polynomials depend on infinitely many time variables, are close relatives of integrable tau-functions, and depend on the choice of the braid representation…

We show the problem of counting homomorphisms from the fundamental group of a homology $3$-sphere $M$ to a finite, non-abelian simple group $G$ is #P-complete, in the case that $G$ is fixed and $M$ is the computational input. Similarly,…