Symmetric bi-derivations on prime and semi-prime rings

Summary LetR be a ring. A bi-additive symmetric mappingD(.,.): R × R R is called a symmetric bi-derivation if, for any fixedy R, a mappingx D(x, y) is a derivation. The purpose of this paper is to prove some results concerning symmetric bi-derivations on prime and semi-prime rings. We prove that the existence of a nonzero symmetric bi-derivationD(.,.): R × R R, whereR is a prime ring of characteristic not two, with the propertyD(x, x)x = xD(x, x), x R, forcesR to be commutative. A theorem in the spirit of a classical result first proved by E. Posner, which states that, ifR is a prime ring of characteristic not two andD ₁,D ₂ are nonzero derivations onR, then the mappingx D ₁(D ₂ (x)) cannot be a derivation, is also presented.     

On a theorem of J. Vukman

Summary LetR be a ring. A bi-additive symmetric mappingD:R × R R is called a symmetric bi-derivation if, for any fixedy R, the mappingx D(x, y) is a derivation. J. Vukman [2, Theorem 2] proved that, ifR is a non-commutative prime ring of characteristic not two and three, and ifD:R × R R is a symmetric bi-derivation such that [D(x, x), x] lies in the center ofR for allx R, thenD = 0. This result is in the spirit of the well-known theorem of Posner [1, Theorem 2], which states that the existence of a nonzero derivationd on a prime ringR, such that [d(x), x] lies in the center ofR for allx R, forcesR to be commutative. In this paper we generalize the result of J. Vukman mentioned above to nonzero two-sided ideals of prime rings of characteristic not two and we prove the following. Theorem.Let R be a non-commutative prime ring of characteristic different from two, and I a nonzero two-sided ideal of R. Let D: R × R R be a symmetric bi-derivation. If [D(x, x), x] lies in the center of R for all x I, then D = 0.     

On some additive mappings in rings with involution

Summary LetR be a *-ring. We study an additive mappingD: R R satisfyingD(x ²) =D(x)x ^* +xD(x) for allx R.It is shown that, in caseR contains the unit element, the element 1/2, and an invertible skew-hermitian element which lies in the center ofR, then there exists ana R such thatD(x) = ax ^* – xa for allx R. IfR is a noncommutative prime real algebra, thenD is linear. In our main result we prove that a noncommutative prime ring of characteristic different from 2 is normal (i.e.xx ^* =x ^* x for allx R) if and only if there exists a nonzero additive mappingD: R R satisfyingD(x ²) =D(x)x ^* +xD(x) and [D(x), x] = 0 for allx R. This result is in the spirit of the well-known theorem of E. Posner, which states that the existence of a nonzero derivationD on a prime ringR, such that [D(x), x] lies in the center ofR for allx R, forcesR to be commutative.     

Kite-freeP- andQ-polynomial schemes

LetY = (X, {R _i } _oid) denote aP-polynomial association scheme. By a kite of lengthi (2 i d) inY, we mean a 4-tuplexyzu (x, y, z, u X) such that(x, y) R ₁,(x, z) R ₁,(y, z) R ₁,(u, y) R _i–1,(u, z) R _i–1,(u, x) R _i. Our main result in this paper is the following.     

Quadratically constrained quadratic programming: Some applications and a method for solution

The problem (QPQR) considered here is: minimizeQ ₁ (x) subject toQ _i (x) 0,i M ₁ {2,...,m},x P R ⁿ, whereQ _i (x), i M {1} M ₁ are quadratic forms with positive semi-definite matrices, andP a compact nonempty polyhedron of Rⁿ. Applications of (QPQR) and a new method to solve it are presented.Letu S={u R ^m;u 0, u _i= l}be fixed;then the problem:iM minimize u _iQ_i (x (u)) overP, always has an optimal solutionx (u), which is either feasible, iM i.e. u C₁ {u S;Q _i (x (u)) 0,i M ₁} or unfeasible, i.e. there exists ani M ₁ withu C {u S; Q_i(x(u)) 0}.Let us defineC _i C_i S _i withS _i {u S; u _i=0}, i M. A constructive method is used to prove that C _i is not empty and thatx (û) withiM û C _i characterizes an optimal solution to (QPQR). Quite attractive numerical results have been reached with this method.

---

Zusammenfassung Die vorliegende Arbeit befaßt sich mit Anwendungen und einer neuen Lösungsmethode der folgenden Aufgabe (QPQR): man minimiere eine konvexe quadratische ZielfunktionQ _i (x) unter Berücksichtigung konvexer quadratischer RestriktionenQ _i (x) 0, iM ₁ {2,...,m}, und/oder linearer Restriktionen.·Für ein festesu S {u R ^m;u 0, u _i=1},M {1} M₁ besitzt das Problem:iM minimiere die konvexe quadratische Zielfunktion u _i Q_i (x (u)) über dem durch die lineareniM Restriktionen von (QPQR) erzeugten, kompakten und nicht leeren PolyederP R ⁿ, immer eine Optimallösungx (u), die entweder zulässig ist: u C₁ {u S;Q ₁ (x (u)) 0,i M ₁} oder unzulässig ist, d.h. es existiert eini M ₁ mitu C_i {u S;Q _i (x(u))0}.Es seien folgende MengenC _i C_i S _i definiert, mitS _i {u S;u _i=0}, i M. Es wird konstruktiv bewiesen, daß C _i 0 undx (û) mitû C _i eine Optimallösung voniM iM (QPQR) ist; damit ergibt sich eine Methode zur Lösung von (QPQR), die sich als sehr effizient erwiesen hat. Ein einfaches Beispiel ist angegeben, mit dem alle Schritte des Algorithmus und dessen Arbeitsweise graphisch dargestellt werden können.

---

---

An earlier version of this paper was written during the author's stay at the Institute for Operations Research, Swiss Federal Institute of Technology, Zürich.     

Piecewise-Convex Maximization Problems: Algorithm and Computational Experiments

A function F : Rⁿ R is called a piecewise convex function if it can be decomposed into F(x)=min{f _j(x) j M}, where f _j :Rⁿ R is convex for all j M={1,2...,m}. In this article, we provide an algorithm for solving F(x) subject to xD, which is based on global optimality conditions. We report first computational experiments on small examples and open up some issues to improve the checking of optimality conditions.     

On the existence of wave operators for the Klein-Gordon equation

The problem of existence of wave operators for the Klein-Gordon equation ( _t ² –+²+iV_1t+V₂)u(x,t)=0 (x R ⁿ,t R, n3, >0) is studied where V₁ and V₂ are symmetric operators in L₂(R ⁿ) and it is shown that conditions similar to those of Veseli-Weidmann (Journal Functional Analysis 17, 61–77 (1974)) for a different class of operators are also sufficient for the Klein-Gordon equation.     

Reconstructing dimensions of intersections of convex sets

Denoting by dimA the dimension of the affine hull of the setA, we prove that if {K _i:i T} and {K _i ^j :i T} are two finite families of convex sets inR ⁿ and if dim {K _i :i S} = dim {K _i ^j :i S}for eachS T such that|S| n + 1 then dim {K _i :i T} = dim {K _i : {i T}}.     

On the complete solution of ∈y″=y 3

In Ref. 1, the author claimed that the problem y=y ³ is soluble only for a certain range of the parameter . An analytic approach, as adopted in the following contribution, reveals that a unique solution exists for any positive value of . The solution is given in closed form by means of Jacobian elliptic functions, which can be numerically computed very efficiently. In the limit 0+, the solutions exhibit boundary-layer behavior at both endpoints. An easily interpretable approximate solution for small is obtained using a three-variable approach.     

Algorithms for proportional matrices in reals and integers

LetR be the set of nonnegative matrices whose row and column sums fall between specific limits and whose entries sum to some fixedh > 0. Closely related axiomatic approaches have been developed to ascribe meanings to the statements: the real matrixf R and the integer matrixa R are proportional to a given matrixp 0.These approaches are described, conditions under which proportional solutions exist are characterized, and algorithms are given for finding proportional solutions in each case.     

Minimization of the Conformal Radius under Circular Cutting of a Domain

Let D be a simply connected domain on the complex plane such that 0 D. For r > 0 , let D _r be the connected component of D {z : |z| < r} containing the origin. For fixed r, we solve the problem on minimization of the conformal radius R(D _r, 0) among all domains D with given conformal radius R(D, 0). This also leads to the solution of the problem on maximization of the logarithmic capacity of the local -extension E (a) of E among all continua E with given logarithmic capacity. Here, E (a) = E {z : |z – a| }, a E, > 0. Bibliography: 12 titles.     

Sums of linear operators of parabolic type: a priori estimates and strong solutions

Summary We study the equation (A – ) x + (B–)x=y, with unknown x, in a Banach space X. y Xis the datum, > 0, A and B are linear closed unbounded operators in X with domains D_A, D_B. In the non commutative case, under assumptions already considered in the literature (see [7]), we show that for large values of any solution x D_A D_B satisfies an a priori estimate ¦|x¦|c^–1¦|y||and we prove that for any y X there exists a unique strong solution x, i.e. there exist x_nD_A D_B such that x_n x, (A–) x_n+(B–) x_ny in X. We also study regularity properties of strong solutions and we show that they belong to suitable interpolation spaces between D_A (or D_B) and X.     

Convergence des solutions formelles de certaines équations fonctionnelles

Résumé Soitq un nombre algébrique de module 1, qui ne soit pas une racine de l'unité, etP [X, Y ₀,Y ₁] un polynôme non nul. Dans cet article, nous montrons que toute solution de l'équation fonctionnelleP(z, (z), (qz))=0, qui est une série formelle (z) dansQ[[z]], a un rayon de convergence non nul.

---

Summary Letq Q be an algebraic number of modulus one that is not a root of unity. LetP Q[X, Y ₀,Y ₁] be a non zero polynomial. In this paper, we show that every formal power series,(z) Q[[z]], solution of the functional equationP(z), (z), (qz)) = 0 has a non zero radius of convergence.

     

The Adjoints of Dilation Operators on H-Cones

If S is an H-cone and P:SS is a localizable dilation operator on S (i.e., P is additive increasing, contractive, continuous in order from below and s(Ps+t–Pt+Pf)S, s,tS,f(S–S)₊), then it is proved that its adjoint P ^*:S ^*S ^* (i.e., P ^*=P) is also a localizable dilation operator. This is an improvement of a result obtained by G. Mokobodzki in the frame of excessive functions.     

Smoothness of solutions of a nonlinear ode

Smoothness of aC -functionf is measured by (Carleman) sequence {M _k} ₀ ; we sayfC _M [0, 1] if|f ^(k) (t)|CR ^k M _k,k=0, 1, ... withC, R>0. A typical statement proven in this paper isTHEOREM: Let u, b be two C -functions on [0, 1]such that (a) u=u ²+b, (b) |b ^(k) (t)|CR ^k (k!) , >1,k_–.Then |u^(k)(t)|C₁R^k((k–1)!),k_–.The first author acknowledges the hospitality of Mathematical Research Institute of the Ohio State University during his one month visit there in the spring of 1999     

On the homogeneity of additive mappings

LetK be a ring with an identity 1 0 andM, L two unitaryK-modules. Then, for any additive mappingf:M L, the setH _f :={ K f(x)=f(x) for allx M} forms a subring ofK, the homogeneity ring off. It is shown that, forM {0},L {0} and any subringS ofK for whichM is a freeS-module, there exists an additive mappingf:ML such thatH _f =S. This result is applied to the four Cauchy functional equations, and it leads also to an answer to the question as to whether it is possible to introduce onM a multiplication ·:M × M M makingM into a ring but not into aK-algebra.     

A generalization of a theorem of M. Riesz to the case of functions of several variables

The following theorem was proved by M. Riesz: Iff(x) L(–,),f(x) 0 and the conjugate functionf (x) is also integrable on [-, ], thenf(x) L log⁺L. The analog of this theorem for functions of several variables is established.Translated from Matematicheskie Zametki, Vol. 4, No. 3, pp. 269–280, November, 1968.     

Lattice of subgroups

Let D be a subgroup of the group G. The lattice of intermediate subgroups is studied. The subgroup F (D F G) is said to be D-complete, if D^F=u:u F>=F. Let F be the subset of all D-complete intermediate subgroups. The system {F, N_G(F)} is a fan for D in G (RZhMat, 1980, 5A208) if and only if D^x> is a D-complete subgroup for any x G. The set {F_ga} coincides with the collection of subgroups of the form D^A (1 A C G) if and only if for any x G the subgroup D, D^x is D-complete. The last condition holds, for example, for a pronormal subgroup D.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 103, pp. 13–19, 1980.     

Über Automorphismenbahnen von Elementen u≠O mit (ad u)3=αad u in endlichdimensionalen einfachen komplexen Lie-Algebren

In this paper we study certain semisimple elements in simple complex Koecher-Tits-constructions from Jordan-triplesystems. Let L be a finite dimensional simple complex Lie-Algebra and u O an element in L with (ad u)³=-ad u. Then there is a compact real form L of L, which contains u. The involutorial automorphism id_L+2 (ad_Lu)² of L induces a Cartan-decomposition of a real form L (u) of L and this gives us a criterion of conjugacy under Aut L for two such elements u₁, u₂L.Using this result, we show that the number of conjugacy classes of elements uL (u O) with (ad u)³=ad u (\{O}, under Aut L is equal to the number of similarity classes of Jordantriplesystems, the Koecher-Tits-construction of which is isomorphic to L. The corresponding data are finally listed for all possible types of L.