A C *-algebra A is called an ideal C * -algebra (or equally a dual algebra) if it is an ideal in its bidual A**. M.C.F. Berglund proved that subalgebras and quotients of ideal C*-algebras are also ideal C*-algebras, that a commutative C *-algebra A is an ideal C *-algebra if and only if it is isomorphicto C (Q) for some discrete space ?. We investigate ideal J*-algebras and show that the a...

We replace the group of group-like elements of the quantized enveloping algebra Uq(g) of a finite dimensional semisimple Lie algebra g by some regular monoid and get the weak Hopf algebra w q (g). It is a new subclass of weak Hopf algebras but not Hopf algebras. Then we devote to constructing a basis of w q (g) and determine the group of weak Hopf algebra automorphisms of w q (g) when q is not ...

let $a$ be a banach algebra and $x$ be a banach $a$-bimodule. then ${mathcal{s}}=a oplus x$, the $l^1$-direct sum of $a$ and $x$ becomes a module extension banach algebra when equipped with the algebra product $(a,x).(a',x')=(aa',ax'+xa').$ in this paper, we investigate biflatness and biprojectivity for these banach algebras. we also discuss on automatic continuity of derivations on ${mathcal{s...

We design an axiomatization for reversible computation called reversible ACP (RACP). It has four extendible modules: basic reversible processes algebra, algebra of reversible communicating processes, recursion and abstraction. Just like process algebra ACP in classical computing, RACP can be treated as an axiomatization foundation for reversible computation.

– We prove that any multi-filtered algebra with semi-commutative associated graded algebra can be endowed with a locally finite filtration keeping up the semi-commutativity of the associated graded algebra. As consequences, we obtain that Gelfand–Kirillov dimension is exact for finitely generated modules and that the algebra is finitely partitive. Our methods apply to algebras of current intere...

DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a normal form for finite expressions can be defined. Unlike most process algebras, however, we show that we can also define a normal form for recursive expressions. This is done by first eliminating operators using the laws of the algebra and then minimizing cycles in a state graph.

Recently it was found [1] that polynomial solutions of differential equations are connected to finite-dimensional representations of the algebra sl2 of firstorder differential operators. In this Talk it will be shown that there also exists a connection between polynomial solutions of finite-difference equations (like Hahn, Charlier and Meixner polynomials) and unusual finitedimensional represen...

In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...

We show that the invariants of a free associative algebra of finite rank under a linear action of a finite-dimensional Hopf algebra generated by group-like and skew-primitive elements form a finitely generated algebra exactly when the action is scalar. This generalizes an analogous result for group actions by automorphisms obtained by Dicks and Formanek, and Kharchenko.

The word, Boolean, was derived from the name of a British mathematician, George Boole, as a result of his classical work on logic. Boolean algebra can be defined as a set, whose members have two possible values, with two binary operators and one unary operator, satisfying the properties of commutativity, associativity, distributivity, existence of identity and complement. Boolean algebra has im...