For graphs G and H , a homomorphism from G to H is a function φ : V (G) → V (H), which maps vertices adjacent in G to adjacent vertices of H . A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H . Many cases of graph homomorphism and locally injective graph homomorphism are NPcomplete, so there is little hope to design polynomial-time...

This paper presents a graph-based knowledge representation and reasoning language. This language benefits from an important syntactic operation, which is called a graph homomorphism. This operation is sound and complete with respect to logical deduction. Hence, it is possible to do logical reasoning without using the language of logic but only graphical, thus visual, notions. This paper present...

We define the Homomorphism Extension (HomExt) problem: given a group G, a subgroup M ≤ G and a homomorphism φ : M → H , decide whether or not there exists a homomorphism φ̃ : G → H extending φ, i.e., φ̃|M = φ. This problem arose in the context of list-decoding homomorphism codes but is also of independent interest, both as a problem in computational group theory and as a new and natural problem i...

‎Let $M$ be a non-zero finitely generated module over a commutative Noetherian local ring $(R,mathfrak{m})$ with $dim_R(M)=t$‎. ‎Let $I$ be an ideal of $R$ with $grade(I,M)=c$‎. ‎In this article we will investigate several natural homomorphisms of local cohomology modules‎. ‎The main purpose of this article is to investigate when the natural homomorphisms $gamma‎: ‎Tor^{R}_c(k,H^c_I(M))to kotim...

We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of deciding whether a structure A ∈ C has a homomorphism to a given arbitrary structure B, when each element in A is only allowed a certain subset of elements of B as its image. We prove, under a certain complexity-theore...

We show that for every binary matroid $N$ there is a graph $H_*$ such the graphic $M_G$ of $G$, matroid-homomorphism from to if and only graph-homomorphism $G$ $H_*$. With this we prove complexity dichotomy problem $\rm{Hom}_\mathbb{M}(N)$ deciding $M$ admits homomorphism $N$. The polynomial time solvable has loop or no circuits odd length, otherwise $\rm{NP}$-complete. also get dichotomies lis...

We discuss Matijevic–Roberts type theorem on strong F -regularity, F -purity, and Cohen–Macaulay F -injective (CMFI for short) property. Related to this problem, we also discuss the base change problem and the openness of loci of these properties. In particular, we define the notion of F -purity of homomorphisms using Radu–André homomorphisms, and prove basic properties of it. We also discuss a...