We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [AAD04] and models introduced and studied by Mazurkiewicz [Maz04a,Maz04b]. We encode these models by labelled (hyper)graphs and relabelling rules on this labelled (hyper)graphs called negotiations. Then for these models, we give complete characterisations of labell...

in this paper, we show that every surjective $n$-homomorphism ($n$-anti-homomorphism) from a banach algebra $a$ into a semisimple banach algebra $b$ is continuous.

In this paper we prove that every n-Jordan homomorphis varphi:mathcal {A} longrightarrowmathcal {B} from unital Banach algebras mathcal {A} into varphi -commutative Banach algebra mathcal {B} satisfiying the condition varphi (x^2)=0 Longrightarrow varphi (x)=0, xin mathcal {A}, is an n-homomorphism. In this paper we prove that every n-Jordan homomorphism varphi:mathcal {A} longrightarrowmathcal...

In this paper, we show that every surjective $n$-homomorphism ($n$-anti-homomorphism) from a Banach algebra $A$ into a semisimple Banach algebra $B$ is continuous.

This paper continues the investigation of the rst author begun in part one. The hereditary properties of n-homomorphism amenability for Banach algebras are investigated and the relations between n-homomorphism amenability of a Banach algebra and its ideals are found. Analogous to the character amenability, it is shown that the tensor product of two unital Banach algebras is n-homomorphism amena...

We try to propose two fully homomorphic encryption (FHE) schemes, one for symmetric (aka. secret-key) settings and another under asymmetric (aka. public-key) scenario. The presented schemes are noiseless in the sense that there is no “noise” factor contained in the ciphertexts. Or equivalently, before performing fully homomorphic computations, our schemes do not incorporate any noise-control pr...

In this talk we will discuss some examples of graph homomorphisms. More precisely, the graph parameters which can be represented by counting the graph homomorphisms. The main reference is Section 2 in [2].