HYERS—ULAM—RASSIAS STABILITY OF QUADRATIC FUNCTIONAL EQUATIONS IN BANACH MODULES OVER A C^＊—ALGEBRA

The authors prove the Hyers-Ulam-Rassias stability of the quadratic mapping in Banach modules over a unital C*-algebra, and prove the Hyers-Ulam-Rassias stability of the quadratic mapping in Banach modules over a unital Banach algebra.     

THE SERRE RELATIONS IN RINGEL－HALL ALGEBRAS

The author constructs the Casimir element of Hall algebras.By the method of Gabber-Kactheorem(see [4]),it is proved that the Serre relations are the defining relations in compositionalgebra.     

The Maximal Graded Left Quotient Algebra of a Graded Algebra1)

We construct the maximal graded left quotient algebra of every graded algebra A without homogeneous total right zero divisors as the direct limit of graded homomorphisms （of left A-modules） from graded dense left ideals of A into a graded left quotient algebra of A. In the case of a superalgebra, and with some extra hypothesis, we prove that the component in the neutral element of the group of the maximal graded left quotient algebra coincides with the maximal left quotient algebra of the component in the neutral element of the group of the superalgebra.     

The pressure in operator algebras

We introduce two notions of the pressure in operator algebras, one is the pressure Pα（π, T） for an automorphism α of a unital exact C^＊-algebra A at a self-adjoint element T in A with respect to a faithful unital ＊-representation π the other is the pressure Pτ,α（T） for an automorphism α of a hyperfinite von Neumann algebra M at a self-adjoint element T in M with respect to a faithful normal α-invariant state τ. We give some properties of the pressure, show that it is a conjugate invaxiant, and also prove that the pressure of the implementing inner automorphism of a crossed product A×α Z at a self-adjoint operator T in A equals that of α at T.     

Realizing enveloping algebras via varieties of modules

By using the Ringel-Hall algebra approach, we investigate the structure of the Lie algebra L（A） generated by indecomposable constructible sets in the varieties of modules for any finite- dimensional C-algebra A. We obtain a geometric realization of the universal enveloping algebra R（A） of L（A）, this generalizes the main result of Riedtmann. We also obtain Green＇s formula in a geometric form for any finite-dimensional C-algebra A and use it to give the comultiplication formula in R（A）.     

On corepresentations of multiplier Hopf algebras

We present a general construction producing a unitary corepresentation of a multiplier Hopf algebra in itself and study RR-corepresentations of twisted tensor coproduct multiplier Hopf algebra. Then we investigate some properties of functors, integrals and morphisms related to the categories of the crossed modules and covariant modules over multiplier Hopf algebras. By doing so, we can apply our theory to the case of group-cograded multiplier Hopf algebras, in particular, the case of Hopf group-coalgebras.     

ON QUASI-TORAL RESTRICTED LIE ALGEBRAS

§1. IntroductionIn the theory of associative ring there are a number of known su?cient conditions forthe commutativity of an associative ring R, some in the form of a polynomial identity.For instance, it is a well-known result that if every element x of …     

群Yetter-Drinfel'd范畴中的Hopf代数

In this note we first show that if H is a finite-dimensional Hopf algebra in a group Yetter-Drinfel＇d category L^LyD（π） over a crossed Hopf group-coalgebra L, then its dual H^＊ is also a Hopf algebra in the category L^LyD（π）. Then we establish the fundamental theorem of Hopf modules for H in the category L^LyD（π）.     

REFINEMENTS OF THE FAN－TODD‘S INEQUALITIES

51. IntroductionIn recent years, refinements or interpolations have played an important role on severaltypes of inequalities with new results deduced as a consequence. Please refer to the papers[2, 8, 9, 12], etc. The aim of this paper is to furnish refinements of the Cauchy's and Bessel'sinequalties as shown in Section 2, and also refinements of the Fan-Todd's inequality and theFan-Todd's determinantal inequality in Sections 3 and 4, with an improved condition forequality derived.First of…     

Tensor Product of Massey Products

In this paper, we interpret Massey products in terms of realizations （twitsting cochains） of certain differential graded coalgebras with values in differential graded algebras. In the case where the target algebra is the cobar construction of a differential graded commutative Hopf algebra, we construct the tensor product of realizations and show that the tensor product is strictly associative, and commutative up to homotopy.     

On farthest points of sets

For a convex closed bounded set in a Banach space, we study the existence and uniqueness problem for a point of this set that is the farthest point from a given point in space. In terms of the existence and uniqueness of the farthest point, as well as the Lipschitzian dependence of this point on a point in space, we obtain necessary and su.cient conditions for the strong convexity of a set in several infinite-dimensional spaces, in particular, in a Hilbert space. A set representable as the intersection of closed balls of a fixed radius is called a strongly convex set. We show that the condition “for each point in space that is sufficiently far from a set, there exists a unique farthest point of the set” is a criterion for the strong convexity of a set in a finite-dimensional normed space, where the norm ball is a strongly convex set and a generating set.     

DC programming techniques for solving a class of nonlinear bilevel programs

We propose a method for finding a global solution of a class of nonlinear bilevel programs, in which the objective function in the first level is a DC function, and the second level consists of finding a Karush-Kuhn-Tucker point of a quadratic programming problem. This method is a combination of the local algorithm DCA in DC programming with a branch and bound scheme well known in discrete and global optimization. Computational results on a class of quadratic bilevel programs are reported.     

Closely embedded Kre?n spaces and applications to Dirac operators

Motivated by energy space representation of Dirac operators, in the sense of K. Friedrichs, we recently introduced the notion of closely embedded Kre?n spaces. These spaces are associated to unbounded selfadjoint operators that play the role of kernel operators, in the sense of L. Schwartz, and they are special representations of induced Kre?n spaces. In this article we present a canonical representation of closely embedded Kre?n spaces in terms of a generalization of the notion of operator range and obtain a characterization of uniqueness. When applied to Dirac operators, the results differ according to a mass or a massless particle in a dramatic way: in the case of a particle with a nontrivial mass we obtain a dual of a Sobolev type space and we have uniqueness, while in the case of a massless particle we obtain a dual of a homogenous Sobolev type space and we lose uniqueness.     

Multi-item capacitated lot-sizing by a Cross decomposition based algorithm

Multi-item capacitated lot-sizing involves the determination of production quantities in different periods in the presence of resource constraints. The model presented in this paper includes a setup time for the production of a lot of an item. The production of items in a given period is constrained by a limited regular time and a limited overtime. Moreover, the production level of any item in a given period is also limited. This problem is tackled by a Cross decomposition based algorithm which can provide an optimal solution, or a near optimal solution if computational time is restricted.     

Global convergence in infeasible-interior-point algorithms

This paper presents a wide class of globally convergent interior-point algorithms for the nonlinear complementarity problem with a continuously differentiable monotone mapping in terms of a unified global convergence theory given by Polak in 1971 for general nonlinear programs. The class of algorithms is characterized as: Move in a Newton direction for approximating a point on the path of centers of the complementarity problem at each iteration. Starting from a strictly positive but infeasible initial point, each algorithm in the class either generates an approximate solution with a given accuracy or provides us with information that the complementarity problem has no solution in a given bounded set. We present three typical examples of our interior-point algorithms, a horn neighborhood model, a constrained potential reduction model with the use of the standard potential function, and a pure potential reduction model with the use of a new potential function.Research supported in part by Grant-in-Aids for Co-Operative Research (03832017) of the Japan Ministry of Education, Science and Culture.Corresponding author.     

On fractional powers of a pair of matrices and a plate-beam problem

In this paper we consider the transversal deflections of a dynamically-coupled Von Kármán system consisting of a plate which has a beam attached to its one edge. The problem is considered in the form of a non-linear evolution problem in a product space. We show the existence of a unique local solution by following a fractional powers approach to first construct a “weak” solution in a larger space. Regularity properties for this solution yield a unique local strong solution for the original boundary-value problem. This approach entails the introduction of fractional powers of a pair of matrices.     

Conic blocking sets in Desarguesian projective planes

Define a conic blocking set to be a set of lines in a Desarguesian projective plane such that all conics meet these lines. Conic blocking sets can be used in determining if a collection of planes in projective three-space forms a flock of a quadratic cone. We discuss trivial conic blocking sets and conic blocking sets in planes of small order. We provide a construction for conic blocking sets in planes of non-prime order, and we make additional comments about the structure of these conic blocking sets in certain planes of even order.     

Current research directions in the development of expert systems based on belief networks

An expert system is a computer program that is designed to solve problems at a level comparable to that of a human expert in a given domain. Often expert systems require a representation of uncertainty. This paper highlights some of the key developments in the history of representing uncertainty in expert systems. An uncertainty representation called belief networks is then introduced and its use in expert systems is motivated. The paper concludes with a discussion of current directions in belief network research.     

Model order reduction by projection applied to the universal Reynolds equation

The approach presented in this paper yields a reduced order solution to the universal Reynolds equation for incompressible fluids, which is valid in lubrication as well as in cavitation regions, applied to oil-film lubricated journal bearings in internal combustion engines. The extent of cavitation region poses a free boundary condition to the problem and is determined by an iterative spatial evaluation of a superposed modal solution. Using a Condensed Galerkin and Petrov–Galerkin method, the number of degrees of freedom of the original grid is reduced to obtain a fast but still accurate short-term prediction of the solution. Based on the assumption that a detailed solution of a previous combustion cycle is available, a basis and an optimal test space for the Galerkin method is generated. The resulting reduced order model is efficiently exploited in a time-saving evaluation of the Jacobian matrix describing the elastohydrodynamic coupling in a multi-body dynamics simulation using flexible components. Finally, numerical results are presented for a single crankshaft main bearing of typical dimensions.