نتایج جستجو برای: homomorphism with threshold alpha

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

Journal: :iranian journal of fuzzy systems 2011
abdelaziz amroune bijan davvaz

the starting point of this paper is given by priestley’s papers, where a theory of representation of distributive lattices is presented. the purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. in this way, some results of priestley’s papers are extended. in the main theorem, we show that the category of finite fuzzy priestley space...

Journal: :Transactions of the American Mathematical Society 1975

Journal: :European Journal for Philosophy of Science 2015

Journal: :Mathematische Zeitschrift 1997

2015
Rakyong Choi Kwangjo Kim

This paper extends the lattice-based linearly homomorphic signature to have multiple signers with the security proof. In our construction, we assume that there are one trusted dealer and either single signer or multiple signers for a message. The dealer pre-shares the message vector v during the set-up phase and issues a pre-shared vector vi to each signer. Then, from partial signatures σi of v...

Journal: :international journal of industrial mathematics 2016
m. oqla massa'deh

in this paper, we introduce some properties of an intuitionistic normal fuzzy m-subgroup of m- group with m-homomorphism and isomorphism. we study he image, the pre-image and the inverse mapping of the intuitionistic normal fuzzy m-‎subgroups.‎

Journal: :Ars Comb. 2014
Meysam Alishahi Ali Taherkhani

The chromatic sum Σ(G) of a graph G is the smallest sum of colors among of proper coloring with the natural number. In this paper, we introduce a necessary condition for the existence of graph homomorphisms. Also, we present Σ(G) < χf (G)|G| for every graph G.

Journal: :CoRR 2017
Stefan Bard Thomas Bellitto Christopher Duffy Gary MacGillivray Feiran Yang

Given two graphs G = (VG, EG) and H = (VH , EH), a homomorphism from G to H is a function f : VG → VH such that for every uv ∈ EG, f(u)f(v) ∈ EH . A homomorphism from G to H is referred to as an H-colouring of G and the vertices of H are regarded as colours. The graph H is called the target of the homomorphism. These definitions extend to directed graphs by requiring that the mapping must prese...

2007
PAUL J. COHEN Walter Rudin

where (x, g) denotes % evaluated at g. Each % thus yields a homomorphism of M(G) onto the complex numbers. Every such homomorphism of L(G) is obtained in this way. Let be a homomorphism of L{G) into M(H). After composing with <[>, every homomorphism of M(H) onto the complex numbers either is identically zero, or can be identified with a member of G. We thus have a map <£* from Ê into {G, 0 ...

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

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