Let G and G' be multiplicative systems. A half-homomorphism of G into G' will mean a mapping a—>a' of G into C such that for all a, bEG, (ab)'=a'V or b'a'. An anti-homomorphism is a mapping such that always (ab)' = b'a'. The terms half-isomorphism, etc., are defined similarly. It will be shown that any half-homomorphism of a group G into a group G' is either a homomorphism or an anti-homomorphi...

Combinatorial structures have been considered under various orders, including substructure order and homomorphism order. In this paper, we investigate the homomorphic image order, corresponding to the existence of a surjective homomorphism between two structures. We distinguish between strong and induced forms of the order and explore how they behave in the context of different common combinato...

KURATOWSKI showed that the derived set operator Z), acting on the space 2^ of closed subsets of a metric space X, is a Borel map of class exactly two and posed the problem of determining the precise classes of the higher order derivatives 0. We show that the exact classes of the higher derivatives D" are unbounded in ©i. In particular, we show that D* is not of class a and that, for limit ordin...

For digraphs D and H , a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). For a fixed digraph H , the homomorphism problem is to decide whether an input digraph D admits a homomorphism to H or not, and is denoted as HOMP(H). Digraphs are allowed to have loops, but not allowed to have parallel arcs. A natural optimization version of the homomorphism probl...

Let $nin mathbb{N}$. An additive map $h:Ato B$ between algebras $A$ and $B$ is called $n$-Jordan homomorphism if $h(a^n)=(h(a))^n$ for all $ain A$. We show that every $n$-Jordan homomorphism between commutative Banach algebras is a $n$-ring homomorphism when $n < 8$. For these cases, every involutive $n$-Jordan homomorphism between commutative C-algebras is norm continuous.

We prove that for every d ≥ 3 the homomorphism order of the class of line graphs of finite graphs with maximal degree d is universal. This means that every finite or countably infinite partially ordered set may be represented by line graphs of graphs with maximal degree d ordered by the existence of a homomorphism.

let $mathcal {a} $ and $mathcal {b} $ be c$^*$-algebras. assume that $mathcal {a}$ is of real rank zero and unital with unit $i$ and $k>0$ is a real number. it is shown that if $phi:mathcal{a} tomathcal{b}$ is an additive map preserving $|cdot|^k$ for all normal elements; that is, $phi(|a|^k)=|phi(a)|^k $ for all normal elements $ainmathcal a$, $phi(i)$ is a projection, and there exists a posit...

The set üS can be identified with the set of all base point preserving maps of $ into itself. SO(n)> acting on S as R with a point a t infinity, is also a set of base point preserving maps of S onto itself. This defines SO(n) C.tiS. The induced map in homotopy is called the /-homomorphism. If we allow n to go to infinity we have the stable /-homomorphism. By Bott 's results [3] 7Ty(50)=Z, i = —...

An order is dense if A < B implies A < C < B for some C. The homomorphism order of (nontrivial) graphs is known to be dense. Homomorphisms of trigraphs extend homomorphisms of graphs, and model many partitions of interest in the study of perfect graphs. We address the question of density of the homomorphism order for trigraphs. It turns out that there are gaps in the order, and we exactly chara...

A graph homomorphism is an edge preserving vertex mapping between two graphs. Locally constrained homomorphisms are those that behave well on the neighborhoods of vertices — if the neighborhood of any vertex of the source graph is mapped bijectively (injectively, surjectively) to the neighborhood of its image in the target graph, the homomorphism is called locally bijective (injective, surjecti...