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

This paper studies the algebraic structure of transposition hypergroups with idempotent identity. Their subhypergroups and their properties are examined. Right, left and double cosets are defined through symmetric subhypergroups and their properties are studied. Further- more, this paper examines the homomorphisms, the behaviour of attrac- tive and non-attractive elements through them, as well ...

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

In this paper we investigate the structure and representation of n-ary algebras arising from DNA recombination, where n is a number of DNA segments participating in recombination. Our methods involve a generalization of the Jordan formalization of observables in quantum mechanics in n-ary splicing algebras. We show that the splicing algebras are an n-ary envelope for algebras of DNA recombinati...

n-ary transit functions are introduced as a generalization of binary (2-ary) transit functions. We show that they can be associated with convexities in natural way and discuss the Steiner convexity as a natural n-ary generalization of geodesicaly convexity. Furthermore, we generalize the betweenness axioms to n-ary transit functions and discuss the connectivity conditions for underlying hypergr...

We characterize the set of all n-ary quasigroups of order 4: every n-ary quasigroup of order 4 is permutably reducible or semilinear. Permutable reducibility means that an n-ary quasigroup can be represented as a composition of k-ary and (n− k +1)-ary quasigroups for some k from 2 to n−1, where the order of arguments in the representation can differ from the original order. The set of semilinea...

The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algorithmic tasks (of an appropriate type), there exist n partial computable functions that use their own graphs in the manner prescribed by those tasks; the n-ary second recursion theorem says that, for any n algorithmic t...