A non-decreasing sequence of positive integer weights P ={p1, p2,..., pn} (n = N*(m-1) + 1, N is number of non-leaves of m-ary tree) is called absolutely ordered if the intermediate sequences of weights produced by m-ary Huffman algorithm for initial sequence P on i-th step satisfy the following conditions 2 , , ) ( 1 ) ( − = < + N 0 i p p i m i m . Let T be an m-ary tree of size n and M=M(T) b...

In this paper we study nearly perfect sequences (NPS) via their connection to direct product difference sets (DPDS). We prove the connection between a p-ary NPS of period n and type γ and a cyclic (n, p, n, n−γ p + γ, 0, n−γ p )-DPDS for an arbitrary integer γ. Next, we present the necessary conditions for the existence of a p-ary NPS of type γ. We apply this result for excluding the existence ...

The family tree of a Galton-Watson branching process may contain N -ary subtrees, i.e. subtrees whose vertices have at least N ≥ 1 children. For family trees without infinite N -ary subtrees, we study how fast N -ary subtrees of height t disappear as t → ∞.

By adopting natural generalizations of relational frame and relational model we showed in [2] that the deontic law D, Dp -» Op, is not universally first-order definable. In effect, we showed there that for n > 2, there is no n-adic first-order sentence p such that for every n-ary frame F,F ^D iff F ^(3 in the first-order sense. The notion of n-ary frame and model employed there may be summarize...

The interconnection network considered in this paper is the k-ary n-cube that is an attractive variance of the well-known hypercube. Many interconnection networks, including the ring, the torus and the hypercube, that are attractive in both theoretical interests and practical systems can be regarded as the subclasses of the k-ary n-cubes. In this paper, we investigate the fault tolerant cycle e...

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

We count all latin cubes of order n ≤ 6 and latin hypercubes of order n ≤ 5 and dimension d ≤ 5. We classify these (hyper)cubes into isotopy classes and paratopy classes (main classes). For the same values of n and d we classify all d-ary quasigroups of order n into isomorphism classes and also count them according to the number of identity elements they possess (meaning we have counted the d-a...

The study of linearly compensated hybrid connectives H = λC +(1−λ)C̄, where C is a t-norm and C̄ represents the dual connective of C, to define aggregation operators for fuzzy classifications is a key point not only in fuzzy sets theory but also in learning processes. Although these operators are not associative, the fact that they can be decomposed into associative functions easily gives rise to...

This article describes an approach to solving distributed constraint optimization problems (DCOP) with n-ary constraints. A key instance of this problem is distributed resource-constrained task scheduling, in which limited resource capacities implicitly imply n-ary relations among the start-times of the tasks. We describe ADOPT-N, an extension of ADOPT [16], a recent successful algorithm for DC...