نتایج جستجو برای: strong homomorphism
تعداد نتایج: 376138 فیلتر نتایج به سال:
We investigate interpretations ‖ψ‖D of formulas ψ in a first order fuzzy logic in models D which are based on Ω-sets, i.e. sets with similarity relations with values in a complete MV-algebra Ω. These interpretations are fuzzy sets in some Ωsets. We show that if φ : D1 → D2 is a strong homomorphism between two models then there are also strong relationships between interpretations ‖ψ‖D1 and ‖ψ‖D...
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...
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...
Graph homomorphism has been studied intensively. Given an m ×m symmetric matrix A, the graph homomorphism function is defined as
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...
A signed graph (G,?) is a G along with function ?:E(G)?{+,?}. closed walk of positive (resp., negative) if it has an even odd) number negative edges, counting repetitions. homomorphism (simple) to another vertex-mapping that preserves adjacencies and signs walks. The chromatic the minimum vertices |V(H)| (H,?) which admits homomorphism. Homomorphisms graphs have been attracting growing attentio...
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 ide- als are found. analogous to the character amenability, it is shown that the tensor product of two unital banach algebras is n-homomorphism am...
All the currently existing homomorphic e-voting schemes are based on additive homomorphism. In this paper a new e-voting scheme based on multiplicative homomorphism is proposed. In the tallying phase, a decryption is performed to recover the product of the votes, instead of the sum of them (as in the additive homomorphic e-voting schemes). Then, the product is factorized to recover the votes. T...
Powerset structures of extensional fuzzy sets in sets with similarity relations are investigated. It is proved that extensional fuzzy sets have powerset structures which are powerset theories in the category of sets with similarity relations, and some of these powerset theories are defined also by algebraic theories (monads). Between Zadeh's fuzzy powerset theory and the classical powerset theo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید