ρ(e)(x) = e · x A1 = x = 1X(x) for all g, h ∈ G and x ∈ X. Thus ρ(gh) = ρ(g) ◦ ρ(h), ρ(e) = 1X and ρ is hence a homomorphism of monoids G → M(X). Then we note 1X = ρ(e) = ρ(gg ) = ρ(g) ◦ ρ(g) and similarly 1X = ρ(g) ◦ ρ(g) and so the ρ(g) are bijections G → G for all g ∈ G. Thus ρ is a homomorphism G → Σ(X). Given a homomorphism λ : G → Σ(X), in order for it to be the action homomorphism of an ...

We propose a new class of algebraic structure named as (m, n)-semihyperring which is a generalization of usual semihyperring. We define the basic properties of (m, n)-semihyperring like identity elements, weak distributive (m, n)semihyperring, zero sum free, additively idempotent, hyperideals, homomorphism, inclusion homomorphism, congruence relation, quotient (m, n)-semihyperring etc. We propo...

By establishing a connection between the sigma polynomial and the homomorphism polynomial, many of the proofs for computing the sigma polynmial are simplified, the homomorphism polynomial can be identified for several new classes of graphs, and progress can be made on identifying homomorphism polynomials.

Let K and L be lattices, and let φ be a homomorphism of K into L. Then φ induces a natural 0-preserving join-homomorphism of ConK into ConL. Extending a result of A. Huhn, the authors proved that if D and E are finite distributive lattices and ψ is a 0-preserving join-homomorphism from D into E, then D and E can be represented as the congruence lattices of the finite lattices K and L, respectiv...

We show that the 2-edge-colored chromatic number of a class of simple graphs is bounded if and only if the acyclic chromatic number is bounded for this class. Recently, the CSP dichotomy conjecture has been reduced to the case of 2-edge-colored homomorphism and to the case of 2-vertex-colored homomorphism. Both reductions are rather long and follow the reduction to the case of oriented homomorp...

‎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...

If (R,M) and (S,N) are quasilocal (commutative integral) domains and f : R → S is a (unital) ring homomorphism, then f is said to be a strong local homomorphism (resp., radical local homomorphism) if f (M) = N (resp., f (M) ⊆ N and for each x ∈ N , there exists a positive integer t such that xt ∈ f (M)). It is known that if f : R→ S is a strong local homomorphism where R is a pseudovaluation do...

For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated with costs ci(u), i ∈ V (H), then the cost of a homomorphism f is ∑ u∈V (G) cf(u)(u). For each fixed digraph H, the minimum cost homomorphism problem for H, denoted MinHOM(H), can be formulated as follows: Given an input digra...

Let p > 2 be a prime, The group ring RG is calculated nearly up to Morita equivalence: The projections of RG into the simple components of KG are given explicitly and the endomorphism rings and homomorphism bimodules between the projective indecomposable RG-lattices are described.

In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing homomorphic encryption algorithms. We make use of ElGamal encryption, Elliptic Curve encryption and a privacy homomorphism, which exhibits the property of homomorphism in our new routing protocol. Elliptic curve exhibits ...