Abstract Isotopies and autotopies of n -ary groups are described. As a consequence, we obtain various characterizations the group automorphisms groups. We also determine number given group.

Our interest in this paper is to define and study the concept of a fuzzy hypergroup, which depends on the concept of a fuzzy space. Indeed, the paper is a continuation of ideas presented by Davvaz [Fuzzy Sets and Systems, 101 (1999) 191-195]. A relation between a fuzzy hypergroup based on a fuzzy space and a fuzzy hypergroup in the sense of Davvaz is obtained 2010 AMS Classification: 20N20

This paper is the results of the ideas suggested by P. Corsini in his paper [10]. Our investigations take in account the paper [13] of I. Cristea. We study the hypergroup generated by the cosets modulo a subgroup (normal subgroup). We prove that (G/H, ◦4) is a complete hypergroup. We take many particular examples to illustrate some known results on hypergroups. Keyword: fuzzy sets, hypergroups,...

Let (Rn(x))n∈N0 be an orthogonal sequence inducing a polynomial hypergroup on N0. The basic facts on polynomial hypergroups and their characters can be found in the monograph [1] or in the papers [6, 7]. A recent review is [8]. The Banach space of almost periodic functions on hypergroups is introduced and studied by the author in [5]. Weakly almost periodic functions are the topic of [12]. It i...

We devise a condition strictly between the existence of an $n$-ary and $n{+}1$-ary near-unanimity term. evaluate exactly distributivity modularity levels implied by such condition.

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

An n-ary operation Q : Σ → Σ is called an n-ary quasigroup of order |Σ| if in the equation x0 = Q(x1, . . . , xn) knowledge of any n elements of x0, . . . , xn uniquely specifies the remaining one. Q is permutably reducible ifQ(x1, . . . , xn) = P ` R(xσ(1), . . . , xσ(k)), xσ(k+1), . . . , xσ(n) ́ where P and R are (n − k + 1)-ary and k-ary quasigroups, σ is a permutation, and 1 < k < n. An m-a...

An n-ary operation q : Σn → Σ is called an n-ary quasigroup of order |Σ| if in x0 = q(x1, . . . , xn) knowledge of any n elements of x0, . . . , xn uniquely specifies the remaining one. An n-ary quasigroup q is permutably reducible if q(x1, . . . , xn) = p(r(xσ(1), . . . , xσ(k)), xσ(k+1), . . . , xσ(n)) where p and r are (n− k + 1)-ary and k-ary quasigroups, σ is a permutation, and 1 < k < n. ...