نتایج جستجو برای: lattice homomorphism
تعداد نتایج: 96728 فیلتر نتایج به سال:
We discuss the construction of a long semi-exact Mayer–Vietoris sequence for homology any finite union open subspaces. This is used to obtain topological conditions representation integral meromorphic n-form on an n-dimensional complex manifold in terms Grothendieck residues. For such exist, it necessary that cycle integration separates set polar hypersurfaces form. The separation condition num...
ABSTRACT In this article an attempt has been made to study some new algebraic structures of intuitionistic multi-anti fuzzy normal subgroups under homomorphism are discussed. Keywords Intuitionistic multi-fuzzy set (IMFS), subgroup (IMAFSG), (IMAFNSG). Mathematics Subject Classification 20N25, 03E72, 08A72, 03F55, 06F35, 03G25, 08A05
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...
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...
Weconsider the colouring (or homomorphism) orderC induced by all finite graphs and the existence of a homomorphism between them. This ordering may be seen as a lattice which is far from being complete. In this paper we study bounds and suprema and maximal elements in C of some frequently studied classes of graphs (such as bounded degree, degenerated and classes determined by a finite set of for...
Obviously each lattice that satisfies either (JID) or (MID) is distributive. A classic result in lattice theory is Funayama’s theorem [5] stating that there is an embedding e of L into a complete Boolean algebra B that preserves all existing joins and meets in L iff L satisfies both (JID) and (MID). Funayama’s original proof was quite involved. For complete L, Grätzer [6, Sec. II.4] gave a more...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید