The aim of this research work is to define and characterize a new class of n-ary multialgebra that may be called canonical (m, n)&minus hypermodules. These are a generalization of canonical n-ary hypergroups, that is a generalization of hypermodules in the sense of canonical and a subclasses of (m, n)&minusary hypermodules. In addition, three isomorphism theorems of module theory and canonical ...

Using a particular construction of generator matrices of the -ary image of -ary cyclic codes, it is proved that some of these codes are invariant under the action of particular permutation groups. The equivalence of such codes with some two-dimensional (2-D) Abelian codes and cyclic codes is deduced from this property. These permutations are also used in the area of the soft-decision decoding o...

This paper describes am-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than a standard rightto-left m-ary exponentiation. This paper demonstrates that the random order countermeasure, commonly used to protect implementations of secret key cryptographic algorithms, can be applied to public key...

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.

Given a binary quasigroup $G$ of order $n$, $d$-iterated $G[d]$ is the $(d+1)$-ary equal to $d$-times composition with itself. The Cayley table every $d$-ary $d$-dimensional latin hypercube. Transversals and diagonals in multiary quasigroups are defined so as coincide those corresponding hypercube.
 We prove that if group $n$ satisfies Hall–Paige condition, then number transversals $ \frac...

The vertex boundary-width problem (for short VBWP) is to determine the value of vbw(G)=max1 |V |minS⊆V,|S|= |N(S)| for a given graph G= (V ,E), where N(S)= {v / ∈ S|v is a neighbor of u for some u ∈ S}. In this paper, we give a lower bound for vertex boundary-width of complete k-ary trees. © 2007 Elsevier B.V. All rights reserved.

Following [1], in this note we compute the average number of protected points in all k-ary trees with n internal points.

We enumerate cyclically colored m-gonal plane cacti (called m-ary cacti) according to the degree distribution of vertices of each color. This combinatorial problem is motivated by the topological classification of complex polynomials having at most m critical values, studied by Zvonkin and others. The corresponding problem for rooted m-ary cacti has been solved by Goulden and Jackson in connect...