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

One of key issues for α-n(t) ary resolution automated reasoning based on lattice-valued logic with truthvalue in a lattice implication algebra is to investigate the α-n(t) ary resolution of some generalized literals. In this article, the determination of α-resolution of any 3-ary generalized literals which include the implication operators not more than 2 in LP(X). It not only lay the foundatio...

Let {Rn} and {Pn} be two polynomial systems which induce signed polynomial hypergroup structures on N0. We investigate when the Banach algebra l(N0, h) can be continuously embedded into or is isomorphic to l(N0, h ). We find sufficient conditions on the connection coefficients cnk given by Rn = ∑n k=0 cnkPk, for the existence of such an embedding or isomorphism. Finally we apply these results t...

The concept of a locally compact hypergroup was introduced by Dunkl [6], Jewett [14] and Spector [26]. Hypergroups generalize convolution algebras of measures associated to groups as well as linearization formulae of classical families of special functions, e.g. orthogonal polynomials. Many results of harmonic analysis on locally compact abelian groups can be carried over to the case of commuta...

In this paper, given a q-ary LCZ sequence set with parameters (N,M,L, ǫ) and even q, we construct another q-ary LCZ sequence set with parameters (2N, 2M,L, 2ǫ) when q is even. Especially for odd L such that L|N , if a q-ary optimal LCZ sequence set with parameters (N,M,L, 1) is used, the new set with parameters (2N, 2M,L, 2) can be optimal in terms of the set size.

Node selection in trees is a fundamental operation to XML databases, programming languages, and information extraction. We propose a new class of querying languages to define n-ary node selection queries as compositions of monadic queries. The choice of the underlying monadic querying language is parametric. We show that compositions of monadic MSO-definable queries capture n-ary MSO-definable ...

The objective of this paper is to introduce the concept of neutrosophic hypergroup and present some of its elementary properties.

A k-ary de Bruijn sequence of order n is a cyclic sequence of length k in which each k-ary string of length n appears exactly once as a substring. A shift rule for a de Bruijn sequence of order n is a function that maps each length n substring to the next length n substring in the sequence. We present the first known shift rule for k-ary de Bruijn sequences that runs in O(1)-amortized time per ...

Any complete hypergroup H may be represented as the union g g G H A ∈ =  , where G is a group and the subsets Ag of H satisfy certain properties. With any hypergroupoid 〈H, o〉 we may associate a particular fuzzy set μ . In this paper we determine sufficient and necessary conditions for a finite complete hypergroup 〈H, o〉, where p G (Z , ) ≅ + or 2p G (Z , ) ≅ + , p a prime number, such that t...

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...