Unless otherwise noted, we consider only n > 0. The parameters in (1.1) are all integers satisfying k, pi and aij > 0. Assume c initial conditions R(1) = ξ1, R(2) = ξ2, . . . , R(c) = ξc, with all ξi > 0. Golomb [6] first solved the simplest example of such a non-homogeneous nested recursion, namely, G(n) = G(n− G(n− 1)) + 1, G(1) = 1; see also [7]. In fact, all of the recursions we find with c...

A consequence of work of Klyachko and of Knutson-Tao is the Horn recursion to determine when a Littlewood-Richardson coefficient is non-zero. Briefly, a LittlewoodRichardson coefficient is non-zero if and only if it satisfies a collection of Horn inequalities which are indexed by smaller non-zero Littlewood-Richardson coefficients. There are similar Littlewood-Richardson numbers for Schur P and...

A consequence of work of Klyachko and of Knutson-Tao is the Horn recursion to determine when a Littlewood-Richardson coefficient is non-zero. Briefly, a LittlewoodRichardson coefficient is non-zero if and only if it satisfies a collection of Horn inequalities which are indexed by smaller non-zero Littlewood-Richardson coefficients. There are similar Littlewood-Richardson numbers for Schur P and...

let be a locally compact non?abelian group and be a compact subgroup of also let be a ?invariant measure on the homogeneous space . in this article, we extend the linear operator as a bounded surjective linear operator for all ?spaces with . as an application of this extension, we show that each frame for determines a frame for and each frame for arises from a frame in via the linear operator .

A deductive database system is an extension of a relational database system by supporting a rulebased, more expressive database language while preserving the set-oriented and declarative style of a relational database query language. This thesis studies the implementation and extension of the chain-based compilation and evaluation method, an interesting method for deductive query evaluation. Ou...