Let g be a nite-dimensional Lie algebra over a eld k of characteristic zero. By Ado's Theorem it is known that there exists a faithful g- module M of nite dimension. Hence we may consider the following integer valued invariant of g: (g): = minfdimk M j M is a faithful g- moduleg:

Commons Attribution License all Copyrights © 2014 are reserved for SCIRP and the owner of the intellectual property Alexander Levichev, Oleg Sviderskiy. All Copyright © 2014 are guarded by law and by SCIRP as a guardian. Contractions of the Lie algebras d = u(2), f = u(1,1) to the oscillator Lie algebra l

Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised

is stable. A policy m,, is obtained which is optimal in the sense that its stability region Cn0 is a superset of the stability region of every other scheduling policy. The stability region Cmo is characterized. Finally, we study the behavior of the network for arrival rates that lie outside the stability

be pos-sible. To reflect this view of computation, [Sar89] develops the cc family of languages. We present here one mem-ber of the family, CC(.L,+) (pronounced “cc with Ask and Choose”) which provides the basic operations of blocking Ask and atomic Tell and an algebra of be-haviors closed under prefixing

Abstract not found

) of X (where n = dim X). Using this graded ring, we will show that X behaves like projective space in many ways. The paper is organized into four sections as follows. In §1, we define the homogeneous coordinate ring S of X and compute its graded pieces in terms of global sections of certain coherent

Abstract. This article presents a general class of associative reinforcement learning algorithms for connectionist networks containing stochastic units. These algorithms, called REINFORCE algorithms, are shown to make weight adjustments in a direction that lies along the gradient of expected

of linear programming. It turns out to be useful to regard “pure matroid theory”, which is only incidentally related to the aspects of algebra which it abstracts, as the study of certain classes of convex polyhedra. (1) A matroid M = (E,F) can be defined as a finite set E and a nonempty family F of so

answering in the context of data exchange. These issues arise because, given a source instance, there may be many target instances that satisfy the constraints of the data exchange problem. We give an algebraic specification that selects, among all solutions to the data exchange problem, a special class