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

In this paper we study relations which are congruences with respect to ∧ and ⊔p, where ⊔pis the p-cut of the L-fuzzy hyperoperation ⊔. The main idea is to start from an equivalence relation R1 which is a congruence with respect to ∧ and ⊔1and, for each p ∈ X , construct an equivalence relation Rp which is a congruence with respect to ∧ and ⊔p. Furthermore, for each x ∈ Rp we construct a quotien...

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

In this paper we start with a lattice (X,∨,∧) and define, in terms of ∨, a family of crisp hyperoperations tp (one hyperoperation for each p ∈ X). We show that, for every p, the hyperalgebra (X,tp) is a join space and the hyperalgebra (X,tp,∧) is very similar to a hyperlattice. Then we use the hyperoperations tp as p-cuts to introduce an L-fuzzy hyperoperation t and show that (X,t) is an L-fuzz...

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 study the L-fuzzy hyperoperation t, which generalizes the crisp Nakano hyperoperation t1. We construct t using a family of crisp tp hyperoperations as its p-cuts. The hyperalgebra (X,t,∧) can be understood as an L-fuzzy hyperlattice. AMS Classification: 06B99, 06D30, 08A72, 03E72, 20N20.

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