If a hyperoperation is weak associative then every greater hyperoperation, defined on the same set, is also weak associative. Using this property, the set of all Hv-groups with a scalar unit, defined on a set with three elements is determined.

Every binary relation ρ on a set H, (card(H) > 1) can define a hypercomposition and thus endow H with a hypercompositional structure. In this paper the binary relations are represented by Boolean matrices. With their help, the hypercompositional structures (hypergroupoids, hypergroups, join hypergroups) that derive with the use of the Rosenberg’s hyperoperation, are characterized, constructed a...

We consider some classes of non-necessarily continuous functions which have played a role in a recent literature on optimization and non-cooperative game theory. With respect to the uniform convergence metric, we prove that the limit of a converging sequence of weakly pseudocontinuous functions is weakly pseudocontinuous, but the similar property is not verified for functions which are either t...

A new class of hypergroupoids, deriving from binary relations, is presented, via the introduced path hyperoperation. Its properties are investigated and its connections with Graph Theory are also delineated. Moreover, we present an application of this hyperoperation to assembly line designing and management.

In this paper, we present some connections between tree automaton theory and hyperstructure theory. In this regard, at first we construct some hyperoperations on the set of trees and, specially, prove that one of them creates a join space. Also, we define a hyperoperation on the states of a tree automaton and, based on the properties of the tree automaton, we show that the proposed hyperoperati...

Hyperstructure theory was born in 1934 when Marty [19] defined hypergroups as a generalization of groups. Let H be a non-empty set and let ℘∗(H) be the set of all non-empty subsets of H. A hyperoperation on H is a map ◦ : H ×H −→ ℘∗(H) and the couple (H, ◦) is called a hypergroupoid. If A and B are non-empty subsets of H, then we denote A◦B = ∪ a∈A, b∈B a◦b, x◦A = {x}◦A and A◦x = A◦{x}. Under c...

This survey article presents some recent results in the theory of hyperfields and hyperrings, algebraic structures for which the "sum" of two elements is a subset of the structure. The results in this paper show that these structures .cannot always be embedded in the decomposition of an ordinary structure (ring or field) in equivalence classes and that the structural results for hyperfields and...

Hyperstructures and binary relations have been studied by many researchers, for instance, Chvalina 1, 2 , Corsini and Leoreanu 3 , Feng 4 , Hort 5 , Rosenberg 6 , Spartalis 7 , and so on. A partial hypergroupoid 〈H, ∗〉 is a nonempty setH with a function fromH×H to the set of subsets of H. A hypergroupoid is a nonempty set H, endowed with a hyperoperation, that is, a function fromH ×H to P H , t...

in this paper, the notion of fuzzy n-polygroups (fn -polygroups) is introduced and some related properties are investigated. in this regards, the concepts of normal  f-subpolygroups and homomorphisms of fn-polygroups are adopted. also, the quotient of fn-polygroups by defining regular relations are studied. finally, the classical isomorphism theorems of groups are generalized to fn-polygroups p...