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

In this paper n-ary regular division associative algebras are discussed. It is shown that every operation in algebra will be endo-linearly represented over the same binary group. Schauffler like theorem proved for those algebras.

The main tools in the theory of n-ary hyperstructures are the fundamental relations. The fundamental relation on an n-ary hypersemigroup is defined as the smallest equivalence relation so that the quotient would be the n-ary semigroup. In this paper we study neutral elements in n-ary hypersemigroups and introduce a new strongly compatible equivalence relation on an n-ary hypersemigroup so that ...

This paper deals with a class of hyperstructures called ordered n-ary semihypergroups which are studied by means j-hyperideals for all positive integers 1≤j≤n and n≥3. We first introduce the notion (softly) left regularity, right intra-regularity, complete generalized regularity investigate their related properties. Several characterizations them in terms provided. Finally, relationships betwee...

Percolation theory is a subject that has been flourishing in recent decades. Because of its simple expression and rich connotation, it widely used chemistry, ecology, physics, materials science, infectious diseases, complex networks. Consider an infinite-rooted N-ary tree where each vertex assigned i.i.d. random variable. When the variable follows Bernoulli distribution, path called head run if...