Results 1 to 10 of about 6,216 (262)
Some of the next articles are maybe not open access.
Superstability of Generalized Derivations [PDF]
We investigate the superstability of the functional equation f(xy)=xf(y)+g(x)y, where f and g are the mappings on Banach algebra A. We have also proved the superstability of generalized derivations associated to the linear functional equation f(γx+
Esmaeil Ansari-Piri, Ehsan Anjidani
doaj +4 more sources
Generalized Derivations of Prime Rings [PDF]
Let R be an associative prime ring, U a Lie ideal such that u2∈U for all u∈U. An additive function F:R→R is called a generalized derivation if there exists a derivation d:R→R such that F(xy)=F(x)y+xd(y) holds for all x,y∈R. In this paper, we prove that
Huang Shuliang
doaj +3 more sources
Characterizations of Commutativity of Prime Ring with Involution by Generalized Derivations
In the paper, we investigate the commutativity of a two-torsion free prime ring R provided with generalized derivations, and some well-known results that characterize the commutativity of prime rings through generalized derivations have been generalized.
Quanyuan Chen
exaly +3 more sources
Generalized derivations of Lie triple systems
In this paper, we present some basic properties concerning the derivation algebra Der (T), the quasiderivation algebra QDer (T) and the generalized derivation algebra GDer (T) of a Lie triple system T, with the relationship Der (T) ⊆ QDer (T) ⊆ GDer (T) ⊆
Liangyun Chen, Yao Ma
exaly +2 more sources
Almost Generalized Derivation on Banach Algebras
We take into consideration generalized derivations. First, we study the stability of generalized derivations on Banach algebras under consideration. Then we prove some theorems involving approximate generalized derivations on Banach algebras.
Jae-Hyeong Bae +2 more
doaj +1 more source
Commutativity Results on Prime Rings With Generalized Derivations [PDF]
Let R be a prime ring. For nonzero generalized derivations F and G associated with the same derivation d, we prove that if d≠0, then R is commutative, if any one of the following conditions hold: (1) [F(x), G(y)] 0, (2) F(x)oG(y) 0, (3) F(x)oG(y ...
A. Majeed, Shaima,a Yass
doaj +1 more source
Generic deriving of generic traversals [PDF]
Functional programmers have an established tradition of using traversals as a design pattern to work with recursive data structures. The technique is so prolific that a whole host of libraries have been designed to help in the task of automatically providing traversals by analysing the generic structure of data types. More recently, lenses have entered
Csongor Kiss +2 more
openaire +3 more sources

