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.

Polyvector-valued gauge field theories in noncommutative Clifford spaces are presented. The noncommutative binary star products are associative and require the use of the Baker-Campbell-Hausdorff formula. An important relationship among the n-ary commutators of noncommuting spacetime coordinates [X, X, ......, X] and the poly-vector valued coordinates X in noncommutative Clifford spaces is expl...

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.

For an odd prime p, an even integer n, and d = p + 1 with gcd(n, k) = 1, there are p + 1 distinct decimated sequences s(dt + l), 0 ≤ l < p + 1, for a p-ary m-sequence s(t) of period p − 1 since gcd(d, p − 1) = p + 1. In this paper, the cross-correlation distribution between a p-ary m-sequence s(t) and its p+1 distinct decimated sequences s(dt+ l) is derived. The maximum magnitude Cmax of their ...

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

For an odd prime p, an even integer n, and d = p + 1 with gcd(n, k) = 1, there are p + 1 distinct decimated sequences s(dt + l), 0 ≤ l < p + 1, for a p-ary m-sequence s(t) of period p − 1 since gcd(d, p − 1) = p + 1. In this paper, the cross-correlation distribution between a p-ary m-sequence s(t) and its p+1 distinct decimated sequences s(dt+l) is derived. The maximum magnitude of their cross-...

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

In this article we introduce the notion of n-capable groups. It is shown that every group G admits a uniquely determined subgroup (〖Z^n)〗^* (G) which is a characteristic subgroup and lies in the n-centre subgroup of the group G. This is the smallest subgroup of G whose factor group is n-capable. Moreover, some properties of n-central extension will be studied.

In this paper parallel algorithms are presented for enumeration and unranking of t–ary trees with n internal nodes. Generation algorithms are designed in the associative computing model ASC that belongs to a broad category of SIMD models. Tree sequences are generated in lexicographical order, with O(1) time per object, in a new representation, as combinations with repetitions with restricted gr...

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