Binary relations and reduced hypergroups

Similar items

• Binary relations and reduced hypergroups

  Scholarly record2008Discrete MathematicsIrina Cristea, Mirela Stefanescu

  Different partial hypergroupoids are associated with binary relations defined on a set H. In this paper we find sufficient and necessary conditions for these hypergroupoids in order to be reduced hypergroups. Given two binary relations and on H we investigate when the hypergroups

•  -hypergroups and  -semihypergroups associated to binary relations

  Article2011iranian journal of science and technology (sciences)b. davvaz

  the concept of  -semihypergroups is a generalization of semigroups, a generalization of semihypergroups and a generalization of  -semigroups. in this paper, we study the concept of semiprime ideals in a  -semihypergroup and prove some results. also, we introduce the notion of

• N-hypergroups and Binary Relations

  Scholarly record2008Eur. J. Comb.Violeta Leoreanu Fotea, Bijan Davvaz

  In this paper, we introduce and study the notion of a partial n-hypergroupoid, associated with a binary relation. Some important results concerning Rosenberg partial hypergroupoids, induced by relations, are generalized to the case of n-hypergroupoids. Then, n-hypergroups associa

• On-line Learning of Binary Relations and Its Application

  Scholarly record1995Naoki Abe, Atsuyoshi Nakamura, Hang Li

  We consider the on-line learning problem for binary relations de ned over two nite sets, each clustered into a relatively small number k; l of `types' (such a relation is termed a (k; l)-binary relation), extending the models of [GRS93][GW93]. We investigate the learning complexi

• Axiomatizability of algebras of binary relations

  Scholarly record2001FotFSSzabolcs Mikulás

  Let Λ be a signature and A = (A, Λ) be an algebra. We say that A is an algebra of binary relations if A ⊆ P(U × U) for some set U and each operation in Λ is interpreted as a natural operation on relations. 0 is the empty set. Other possible operations include reexive-transitive c

• Undecidable Problems on Representability as Binary Relations

  Scholarly record2009ROBIN HIRSCH, MARCEL JACKSON

  We establish the undecidability of representability and of finite representability as algebras of binary relations in a wide range of signatures. In particular, representability and finite representability are undecidable for Boolean monoids and lattice ordered monoids, while rep