In this paper, we classify the indecomposable non-nilpotent solvable Lie algebras with $N(R_n,m,r)$ nilradical,by using the derivation algebra and the automorphism group of $N(R_n,m,r)$.We also prove that these solvable Lie algebras are complete and unique, up to isomorphism.

Given a strong deformation retract M of an algebra A, there are several apparently distinct ways ([9],[19], [13], [24],[15], [18], [17]) of constructing a coderivation on the tensor coalgebra of M in such a way that the resulting complex is quasi isomorphic to the classical (differential tor) [7] bar construction of A. We show that these methods are equivalent and are determined combinatorially...

0

We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.

it is shown that every  almost linear bijection $h : arightarrow b$ of a unital $c^*$-algebra $a$ onto a unital$c^*$-algebra $b$ is a $c^*$-algebra isomorphism when $h(3^n u y) = h(3^n u) h(y)$ for allunitaries  $u in a$, all $y in a$, and all $nin mathbb z$, andthat almost linear continuous bijection $h : a rightarrow b$ of aunital $c^*$-algebra $a$ of real rank zero onto a unital$c^*$-algebra...

The power of top-down tree transducers and tree-to-graph-to-tree transducers (tgt transducers) to compute translations between hyperedge-replacement algebras is investigated. It turns out that top-down tree transducers are too weak in many cases. Tgt transducers are shown to be more powerful.

in this paper, we introduce the notion of multiplier in -algebra and study relationships between multipliers and some special mappings, likeness closure operators, homomorphisms and ( -derivations in -algebras. we introduce the concept of idempotent multipliers in bl-algebra and weak congruence and obtain an interconnection between idempotent multipliers and weak congruences. also, we introduce...