A class of n-ary Poisson structures of constant rank is indicated. Then, one proves that the ternary Poisson brackets are exactly those which are deened by a decomposable 3-vector eld. The key point is the proof of a lemma which tells that an n-vector (n 3) is decomposable ii all its contractions with up to n ? 2 covectors are decomposable. In the last years, several authors have studied genera...

The transformation from n-ary relationships to a relational database schema has never been really fully analyzed. This paper presents one of the several ternary cases ignored by the ER-to-RM literature. The case shows that the following common belief is wrong: Given a set of FDs over a table resulting in a non-3NF situation, it is always possible to obtain a fully equivalent set of 3NF tables, ...

A class of n-ary Poisson structures of constant rank is indicated. Then, one proves that the ternary Poisson brackets are exactly those which are defined by a decomposable 3-vector field. The key point is the proof of a lemma which tells that an n-vector (n ≥ 3) is decomposable iff all its contractions with up to n− 2 covectors are decomposable. In the last years, several authors have studied g...

A class of n-ary Poisson structures of constant rank is indicated. Then, one proves that the ternary Poisson brackets are exactly those which are defined by a decomposable 3-vector field. The key point is the proof of a lemma which tells that an n-vector (n ≥ 3) is decomposable iff all its contractions with up to n − 2 covectors are decomposable. In the last years, several authors have studied ...

Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of a connective is introduced and no other connective is mentioned. [2] provides a constructive coherence criterion for the non-triviality of such systems and shows that a system of this kind admits cut...

Abstract: Allegories are enriched categories generalizing a category of sets and binary relations. Accordingly, relational products in an allegory can be viewed as a generalization of Cartesian products. There are several definitions of relational products currently in the literature. Interestingly, definitions for binary products do not generalize easily to n-ary ones. In this paper, we provid...

In this paper, we address the problem of closed pattern mining from n-ary relations. We propose CnS-Miner algorithm which enumerates all the closed patterns of the given n-dimensional dataset in depth first manner satisfying the user specified minimum size constraints. From the given input, the CnS-Miner algorithm generates an n-ary tree and visits the tree in depth first manner. We have propos...

In this paper, we describe a logical ontology design pattern that summarizes a relationship and its inverse between two distinguished members of an n-ary relationship.

In this paper, we present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with ðjÞ n spare nodes. Each set of j regular nodes is connected to a spare node and the spare nodes are interconnected as either a ðkjÞ-ary n-cube if j 61⁄4 k2 or a hypercube of dimension n if j 1⁄4 k2 . Our approach utilizes the...