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

For any given k, the sequence of k-ary Catalan numbers, Ct,k = 1 kt+1 ( kt t ) , enumerates a number of combinatorial objects, including k-ary Dyck words of length n = kt and k-ary trees with t internal nodes. We show that these objects can be efficiently ordered using the same variation of lexicographic order known as cool-lex order. In particular, we provide loopless algorithms that generate ...

When n is odd, a cohomology of type Hochschild for n-ary partially associative algebras has been defined in Gnedbaye’s thesis. Unfortunately, the cohomology definition is not valid when n is even. This fact is found again in the computations of the n-ary partially associative free algebra. In this work, we define in a first time two approachs of an Hochschild cohomology for n-ary partially asso...

Binary t-frameproof codes (t-FPCs) are used in multimedia fingerprinting schemes where the identification of authorized users taking part in the averaging collusion attack is required. In this paper, a binary strongly t-separable code (t-SSC) is introduced to improve such a scheme based on a binary t-FPC. A binary t-SSC has the same traceability as a binary t-FPC but has more codewords than a b...

In general, an n-ary predicate (relation) describes the relationship among its arguments, and such that no argument has to be of a special mode. The uniication and the resolution (SLDNF-resolution) do capture this state of aaair. Hence, the aim of logic programming is in some point approximatively achieved if the system is able to automatically determine the descriptive mode of an n-ary predica...

In this paper, we investigate the fault-tolerant capabilities of the k-ary n-cubes for even integer k with respect to the hamiltonian and hamiltonian-connected properties. The k-ary n-cube is a bipartite graph if and only if k is an even integer. Let F be a faulty set with nodes and/or links, and let k 3 be an odd integer. When |F | 2n−2, we show that there exists a hamiltonian cycle in a wound...

The notion of absorption was developed a few years ago by Barto and Kozik and immediately found many applications, particularly in topics related to the constraint satisfaction problem. We investigate the behavior of absorption in semigroups and n-ary semigroups (that is, algebras with one n-ary associative operation). In the case of semigroups, we give a simple necessary and sufficient conditi...

The Golay complementary sequences have been studied for more than five decades since Golay first discovered those sequences. However, few studies on the correlation function of transformation form of q-ary complementary sequences. New notions of equivalent transformation on q-ary sequences and equivalent transformation pair of a q-ary sequence and its complex polyphase form are put forward. A t...