Results 91 to 100 of about 7,960 (211)

Homomorphic and restricted homomorphic products of soft graphs

open access: yesJournal of the Nigerian Society of Physical Sciences
Molodtsov pioneered the notion of soft set theory, presenting it as a mathematical tool for dealing with uncertainty. Numerous researchers have subsequently developed models leveraging this theory to tackle challenges in decision-making and medical diagnosis.
Jinta Jose   +4 more
openaire   +2 more sources

Linear index coding via graph homomorphism [PDF]

open access: green, 2014
Javad B. Ebrahimi   +1 more
openalex   +1 more source

Reflexive Homomorphic Relations [PDF]

open access: yesCanadian Mathematical Bulletin, 1960
It is well known that a symmetric and transitive relation on a set is reflexive wherever it is defined. In this note we show that a converse is true for homomorphic relations in certain classes of algebras.Consider a class of similar algebras which contains the sub-algebras and quotient algebras of each of its members.
openaire   +2 more sources

THE PROBLEM OF NEW PROPERTIES OF NUMBERS

open access: yesНадежность и качество сложных систем
Background. The proposed work is devoted to research to clarify the axiomatization of arithmetic in connection with the presence of special assumptions in it.
L.G. Sushkov
doaj   +1 more source

New secure distributed secret sharing scheme of n product

open access: yesTongxin xuebao, 2014
Since Shamir’s secret sharing scheme does not have the property of the multiplicative homomorphism,an encoding method is utilized for privacy-preserving data to overcome the drawbacks in secure distributed multiplication calculation when using ...
Zhen-hua CHEN   +4 more
doaj   +2 more sources

HOMOMORPHISM IN ROUGH LATTICE

open access: yesJournal of New Theory, 2015
− In this paper, we introduce the concept of set-valued homomorphism of a lattice which isthe generalization of ordinary lattice homomorphism. We construct generalized rough lower and upperapproximations operators, by means of a set-valued mapping, which
Dipankar Rana, Sankar Kumar Roy
doaj  

Undecidability of polynomial inequalities in weighted graph homomorphism densities

open access: yesForum of Mathematics, Sigma
Many problems and conjectures in extremal combinatorics concern polynomial inequalities between homomorphism densities of graphs where we allow edges to have real weights.
Grigoriy Blekherman   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy