نتایج جستجو برای: homomorphism

تعداد نتایج: 3615  

Journal: :Electronic Notes in Discrete Mathematics 2017

Journal: :Bulletin of the American Mathematical Society 1958

Journal: :Reports on Mathematical Physics 1996

Journal: :Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 1989

Journal: :Journal of Siberian Federal University. Mathematics and Physics 2021

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...

Journal: :Indian Scientific Journal Of Research In Engineering And Management 2023

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

Journal: :CoRR 2007
Gregory Gutin Eun Jung Kim

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...

Journal: :Discrete Applied Mathematics 2011
Tomás Feder Pavol Hell David G. Schell Juraj Stacho

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...

2007
Levent Ertaul

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...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید