Motivated by a result on weak Markov dilations, we define a notion of characteristic function for ergodic and coisometric row contractions with a one-dimensional invariant subspace for the adjoints. This extends a definition given by G.Popescu. We prove that our characteristic function is a complete unitary invariant for such tuples and show how it can be computed. Mathematics Subject Classific...

The paper presents an approach to describe the semantics of reusable software components by specifiably chosen input-output tuples. The initial data basis for such tuples are test cases. We discuss, how test cases can serve as descriptors for software components. Further, it is shown how an optimal search structure can be obtained from such tuples by means of supervised learning.

The function lattice, or generalized Boolean algebra, is the set of `-tuples with the ith coordinate an integer between 0 and a bound ni. Two `-tuples t-intersect if they have at least t common nonzero coordinates. We prove a Hilton–Milner type theorem for systems of t-intersecting `-tuples.

We consider the problem of counting simultaneous conjugacy classes n-tuples in a finite group G. Let αG,n denote number n-tuples, and βG,n commuting study generating functions AG(t)=∑n≥0αG,ntn, BG(t)=∑n≥0βG,ntn, which are rational t. show that AG(t) determines is completely determined by class equation prove normalized AG(t/|G|) BG(t/|G|) invariants isoclinism families. compute exponential grow...

This document describes the implementation of Flikken, a mobile game implemented using context-aware tuples in which players equipped with mobile devices interact in a physical environment augmented with virtual objects. Coordination and interaction between players is fully specified by means of context-aware tuples and reactions to some of these tuples e.g. to show on the GUI the virtual objec...

Two research efforts have been conducted to realize sliding-window queries in data stream management systems, namely, query reevaluation and incremental evaluation. In the query reevaluation method, two consecutive windows are processed independently of each other. On the other hand, in the incremental evaluation method, the query answer for a window is obtained incrementally from the answer of...