Results 251 to 260 of about 697,368 (288)
Some of the next articles are maybe not open access.
ON REDUCTIVE OPERATORS AND OPERATOR ALGEBRAS
Mathematics of the USSR-Izvestiya, 1976We prove a theorem on the structure of weakly closed reductive operator algebras. The proof essentially relies on a known result of V. I. Lomonosov on transitive operator algebras containing a nonzero compact operator. We deduce a number of corollaries which apply to the reductivity problem.Bibliography: 20 titles.
Loginov, A. I., Sul'man, V. S.
openaire +2 more sources
The Measure Algebra as an Operator Algebra
Canadian Journal of Mathematics, 1968In § I, it is shown that M(G)*, the space of bounded linear functionals on M(G), can be represented as a semigroup of bounded operators on M(G).Let △ denote the non-zero multiplicative linear functionals on M(G) and let P be the norm closed linear span of △ in M(G)*.
openaire +2 more sources
Heyting Algebras with Operators
MLQ, 2001In this paper, the author studies Heyting algebras with unary operators, that is, algebras \({\mathbf A}= ({\mathbf {A'}},M)\), where \({\mathbf {A'}}\) is a Heyting algebra and \(M\) is a finite set of unary operators \(m_1,\dots, m_k\). A general description of subdirectly irreducible Heyting algebras with operators is given under some conditions ...
openaire +3 more sources
Algebraic Inner Derivations on Operator Algebras
Canadian Journal of Mathematics, 1983Let A be a C*-algebra, let p be a polynomial over C, and let a in M(A) (the multiplier algebra of A) be such that p(ad a) = 0. In this paper we study the following problem: when does there exist λ in Z(M(A)) (the centre of M(A)) such that p(a – λ) = 0? The first result of this type known to us is due to I. N.
Miers, C. Robert, Phillips, John
openaire +2 more sources
Operators and algebraic structures
Proceedings of the 1981 conference on Functional programming languages and computer architecture - FPCA '81, 1981Operators in functional languages such as APL and FFP are a useful programming concept. However, this concept cannot be fully exploited in these languages because of certain constraints. It is proposed that an operator should be associated with a structure having the algebraic properties on which the operator's behavior depends.
Deepak Kapur +2 more
openaire +1 more source
Not all H′-algebras are operator algebras
Mathematical Proceedings of the Cambridge Philosophical Society, 1979An H′-algebra which is not an operator algebra is constructed. This is used to prove that the class of operator algebras is not equal to the class of α-algebras for any tensor norm α.
openaire +1 more source
Isometries of Operator Algebras
The Annals of Mathematics, 1951Let \(X\) and \(Y\) be compact Hausdorff spaces, and let \(C(X, K)\) resp. \(C(Y, K)\) denote the sets of continuous complex-valued functions on \(X\) resp. \(Y\). It is known that a linear isometry of \(C(X, K)\) onto \(C(Y, K)\) (under the uniform metric for both spaces) is actually an algebraic isomorphism followed by multiplication by a function in
openaire +2 more sources
American Journal of Mathematics, 1977
Let A be a finite dimensional Hopf algebra with antipode s over a field k. In (6) the structure of s and s2 is seen to be closely related to the important algebraic features of A and A*. This paper furthers the investigation. More generally "locally finite" bialgebra endomorphisms t:A ->A of an arbitrary Hopf algebra A are considered (this means A is ...
openaire +2 more sources
Let A be a finite dimensional Hopf algebra with antipode s over a field k. In (6) the structure of s and s2 is seen to be closely related to the important algebraic features of A and A*. This paper furthers the investigation. More generally "locally finite" bialgebra endomorphisms t:A ->A of an arbitrary Hopf algebra A are considered (this means A is ...
openaire +2 more sources
1991
Relational algebra is the instruction set of relati onal database systems. In this paper, a set of rela tional algebra operations are described and slightly enhanced for improved ef ficiency. How these routines can be implemented on a parallel database computer is described in detail.
openaire +2 more sources
Relational algebra is the instruction set of relati onal database systems. In this paper, a set of rela tional algebra operations are described and slightly enhanced for improved ef ficiency. How these routines can be implemented on a parallel database computer is described in detail.
openaire +2 more sources
Algebraic Automorphisms of Operator Algebras
Journal of the London Mathematical Society, 1974Kadison, Richard V., Ringrose, John R.
openaire +2 more sources

