نتایج جستجو برای: valued homomorphism
تعداد نتایج: 43319 فیلتر نتایج به سال:
Abstract: Commutative monoids of belief states have been defined by imposing one or more of the usual axioms and employing a combination rule. Familiar operations such as normalization and the Voorbraak map are surjective homomorphisms. The latter, in particular, takes values in a space of Bayesian states. The pignistic map is not a homomorphism between these same spaces. We demonstrate an impa...
If G is a locally compact topological group, let BC{G) denote the set of real-valued, bounded, uniformly continuous functions on G with the compact-open topology. Using the fact that the distal (weakly distal) functions are the elements of BC(G) whose orbit closures are compact distal (point-distal) minimal sets, we can characterize compact distal and point-distal minimal transformation groups....
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...
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to be polynomial time solvable or NP -complete. Thus while digraph list homomorphism problems enjoy dichotomy (each problem is NP -complete or polynomial time solvable), such dichotomy is not necessarily expected for tri...
In this paper we provide a new scheme to securely forward the message in wireless mobile ad hoc networks (MANETs) by using existing homomorphic encryption schemes. This scheme is an alternative for threshold cryptography (TC) in MANETs to securely forward the message. By using homomorphic encryption schemes we remove the computational cost associated with Lagrange Interpolation scheme used in T...
We prove that in the category of achimedean lattice-ordered groups with weak unit there is no homomorphism-closed monoreflection strictly between the strongest essential monoreflection (the so-called “closure under countable composition”) and the strongest monoreflection (the epicompletion). It follows that in the category of regular σframes, the only non-trivial monoreflective subcategory that...
The role of symmetry in ring theory is universally recognized. most directly definable universal relation a symmetric set isomorphism. This article develops certain structure bipolar fuzzy subrings, including quotient ring, homomorphism, and We define (?,?)-cut investigate the algebraic attributions this phenomenon. also support prove various important properties relating to concept. Additional...
Kleene’s strong three-valued logic extends naturally to a four-valued logic proposed by Belnap. We introduce a guard connective into Belnap’s logic and consider a few of its properties. Then we show that by using it four-valued analogs of Kleene’s weak three-valued logic, and the asymmetric logic of Lisp are also available. We propose an extension of these ideas to the family of distributive bi...
Suppose A, S, and T are semigroups, e: A → S and f : A → T semigroup homomorphisms, and X a generating set for S. We assume (1) that every element of S divides some element of e(A), (2) that T is cancellative, (3) that T is power-cancellative (i.e, xd = yd ⇒ x = y for d > 0), and (4) a further technical condition, which in particular holds if T admits a semigroup ordering with the order-type of...
The purpose of this paper is to introduce and discuss the concept of T-rough (prime, primary) ideal and T-rough fuzzy (prime, primary) ideal in a commutative ring . Our main aim in this paper is, generalization of theorems which have been proved in [6, 7, 11]. At first, T-rough sets introduced by Davvaz in [6]. By using the paper, we define a concept of T-rough ideal , T-rough quotient ideal an...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید