Prime Rings with Involution Equipped with Some New Product

Let R be a ring with involution *. We consider R as a ring equipped with a new product r s = rs + sr^*. The relationship between (ordinary) ideals of R and right ideals of R with respect to the product is studied.AMS Subject Classification (2000): 16W10, 16D25     

Partial Padé prediction

When the first terms of a sequence (called sequence to predict) are known, a prediction method is a method which gives us an approximation of the following terms (the so-constructed sequence is called the predicted sequence). In this paper, we state two prediction methods, respectively called _p-prediction and partial Padé prediction, which are generalizations of Aitken's ²-prediction of Brezinski and Redivo-Zaglia [6] and Padé prediction of Gilewicz [8] which are very simple to use. In order to choose among the different partial Padé predictions, we study some of their properties. The most important points of this paper are: the use of an extrapolation algorithm (the -algorithm), to obtain a prediction algorithm for each partial Padé prediction (which avoids solving a system); the results about consistency obtained for the partial Padé prediction (i.e., under certain conditions, each term of the predicted sequence converges to the analogous term of the sequence to predict).     

Maximal Monotone Multifunctions of Br?ndsted–Rockafellar Type

We consider whether the inequality-splitting property established in the Brøndsted–Rockafellar theorem for the subdifferential of a proper convex lower semicontinuous function on a Banach space has an analog for arbitrary maximal monotone multifunctions. We introduce the maximal monotone multifunctions of type (ED), for which an inequality-splitting property does hold. These multifunctions form a subclass of Gossez"s maximal monotone multifunctions of type (D); however, in every case where it has been proved that a multifunction is maximal monotone of type (D) then it is also of type (ED). Specifically, the following maximal monotone multifunctions are of type (ED): ultramaximal monotone multifunctions, which occur in the study of certain nonlinear elliptic functional equations; single-valued linear operators that are maximal monotone of type (D); subdifferentials of proper convex lower semicontinuous functions; subdifferentials of certain saddle-functions. We discuss the negative alignment set of a maximal monotone multifunction of type (ED) with respect to a point not in its graph – a mysterious continuous curve without end-points lying in the interior of the first quadrant of the plane. We deduce new inequality-splitting properties of subdifferentials, almost giving a substantial generalization of the original Brøndsted–Rockafellar theorem. We develop some mathematical infrastructure, some specific to multifunctions, some with possible applications to other areas of nonlinear analysis: the formula for the biconjugate of the pointwise maximum of a finite set of convex functions – in a situation where the obvious formula for the conjugate fails; a new topology on the bidual of a Banach space – in some respects, quite well behaved, but in other respects, quite pathological; an existence theorem for bounded linear functionals – unusual in that it does not assume the existence of any a priori bound; the 'big convexification" of a multifunction.     

Matrix symbol of order two for some Banach algebras

Two classes of Banach algebras which admit a matrix symbol of order 2 are described, and an explicit form of the symbol is obtained. Also we describe all polynomialsF(X, Y) andF(X, Y, Z) such that the norms of polynomialsF(B, B ^*) (whenB ²=0) andF(S, W, W ^* ) (whenS ² =I, W ² =0, S ^*=S) depend only on the polynomialF and on the norms B, W. Applications to Banach algebras generated by singular integral operators and some their perturbations are considered.     

Complete controllability

A linear autonomous control system in ⁿ is said to be completely controllable iff there existsT>0 such that eachx ⁿ can be steered to anyy ⁿ in timeT. This paper presents a geometric characterization of this property in the case in which there are constraints on the values which the control maps can assume. A necessary and sufficient condition to get instant controllability (i.e., complete controllability for anyT>0) is also derived. This condition generalizes the well-known Kalman condition to the constrained case.     

Addendum to “Stronger than uniform convergence of multistep difference methods”

This paper fills a gap which remained in Stronger than Uniform Convergence of Multistep Difference Methods, Numerische Mathematik 8, 29 (1966), namely to show that from the stability of the homogeneous difference operator on the particular basis chosen in the solution space one can infer its stability on the whole solution space.     

Multi-stage stochastic optimization applied to energy planning

This paper presents a methodology for the solution of multistage stochastic optimization problems, based on the approximation of the expected-cost-to-go functions of stochastic dynamic programming by piecewise linear functions. No state discretization is necessary, and the combinatorial explosion with the number of states (the well known curse of dimensionality of dynamic programming) is avoided. The piecewise functions are obtained from the dual solutions of the optimization problem at each stage and correspond to Benders cuts in a stochastic, multistage decomposition framework. A case study of optimal stochastic scheduling for a 39-reservoir system is presented and discussed.     

Certain nonlocal problems for two-dimensional equations of motion of Oldroyd fluids

The solvability of a boundary-value problem on the semi-axis t0 is studied for two-dimensional equations of motion of Oldroyd fluids (1), and with trivial problem data a proof is given of the existence of a solution which is periodic with respect to t and has the period . This solution has an absolute term which is also periodic with respect to t and has the period . Substantiation is given for the principle of linearization (first Liapunov method) in the theory of the exponential stability of solutions at t.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 189, pp. 101–121, 1991.     

Lawless order

R. Baer asked whether the group operation of every (totally) ordered group can be redefined, keeping the same ordered set, so that the resulting structure is an Abelian ordered group. The answer is no. We construct an ordered set (G, ) which carries an ordered group (G, , ) but which islawless in the following sense. If (G, *, ) is an ordered group on the same carrier (G, ), then the group (G, *) satisfies no nontrivial equational law.Research partially supported by NSERC of Canada Grants #A4044 and A3040.Research partially supported by NSERC of Canada Grant #U0075.Research partially supported by a grant from the BSF.     

A Property of the Ansatz of Hirota's Method for Quasilinear Parabolic Equations

By using the recently discovered new invariant properties of the ansatz of R. Hirota's method, we prove that the classes of linear fractional solutions to some nonlinear equations are closed. This allows us to construct new solutions for a chosen class of dissipative equations. This algorithm is similar to the method of dressing the solutions of integrable equations. The equations thus obtained imply a compatibility condition and are known as a nonlinear Lax pair with variable coefficients. So we propose a method for constructing such pairs. To construct solutions of a more complicated form, we propose to use the property of zero denominators and factorized brackets, which has been discovered experimentally. The expressions thus constructed are said to be quasi-invariant. They allow us to find true relations between the functions contained in the ansatz, to correct the ansatz, and to construct a solution. We present some examples of new solutions constructed following this approach. Such solutions can be used for majorizing in comparison theorems and for modeling phase processes and process in neurocomputers. A program for computing solutions by methods of computer algebra is written. These techniques supplement the classical methods for constructing solutions by using their group properties.     

Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes

We define an analogue of Schnyder's tree decompositions for 3-connected planar graphs. Based on this structure we obtain: Let G be a 3-connected planar graph with f faces, then G has a convex drawing with its vertices embedded on the (f–1)×(f–1) grid. Let G be a 3-connected planar graph. The dimension of the incidence order of vertices, edges and bounded faces of G is at most 3.The second result is originally due to Brightwell and Trotter. Here we give a substantially simpler proof.     

μ-Reducible Languages

A word w is said to be a primitive word if it cannot be expressed as a power of any other word. A language L consisting of non-empty words is called -reducible if there exists a non-empty word w such that Lw contains only finitely many powers of each primitive word. We show that every regular component, context-free component, local language and every regular language containing no primitive words are -reducible. Languages which are not -reducible are investigated and characterized. We show that every code is -reducible. But there are 2-codes which are not -reducible. The -annihilator of a language L is the set of all non-empty words w such that Lw contains only finitely many powers of each primitive word. This paper also concerns the properties of the -annihilators of languages. The -annihilators of 2-codes and some other languages are investigated and characterized in this paper. The results provide an outline of the relationship between the catenation of languages and the powers of primitive words.     

On the Varieties of Parabolic Subgroups, their Generalizations and Combinatorial Applications

Investigations of homogeneous varieties T=(G:P) of all cosets of finite Coxeter or Chevalley groups G by their maximal parabolic subgroups P had been conducted at the Kalunin seminar at Kiev State University since the 1970s, as were investigations of their corresponding permutation groups, geometries and association schemes.In I. A. Faradev et al. (eds), Investigations in Algebraic Theory of Combinatorial Objects (Kluwer Acad. Publ., 1994), one can find some results on the investigation of noncomplete Galois correspondence between fusion schemes of the orbital scheme for (G,T) and overgroups of (G,T), as well as calculations of the intersectional indices of the Hecke algebra of (G,T). We will discuss additional results on this topic and consider questions related to the following problems: embeddings of varieties (G:P) into the Lie algebra corresponding to Chevalley group G; interpretations of Lie geometries, small Schubert cells, connections between the geometry of G and its associated Weyl geometry in terms of linear algebra, and applications of these problems to calculations performed in Lie geometries and association schemes; constructions of geometric objects arising from Kac–Moody Lie algebras and superalgebras, and applications of these constructions to investigations of graphs of large girth and large size.     

An algorithm for convex constrained minimax optimization based on duality

We consider the problem of finding the minimum value of the upper hull ofn convex functionals on a Hilbert space, subject to convex constraints. The problem is reformulated as that of finding the minimum of the worst convex combination of these functionals, which eventually yields a saddle-point problem. We propose a new algorithm to solve this problem that simplifies the task of updating the dual variables. Simultaneously, the constraints can be dualized by introducing other dual multipliers. Convergence proofs are given and a concrete example shows the practical and computational advantages of the proposed algorithm and approach.This research has been supported by the Centre National de la Recherche Scientifique (CNRS-France) under Contract No. ATP-2340.     

Simplicial Cohomology with Coefficients in Symmetric Categorical Groups

In this paper we introduce and study a cohomology theory {H ⁿ (–,A)} for simplicial sets with coefficients in symmetric categorical groups A. We associate to a symmetric categorical group A a sequence of simplicial sets {K(A,n)} _n0, which allows us to give a representation theorem for our cohomology. Moreover, we prove that for any n3, the functor K(–,n) is right adjoint to the functor _n , where _n (X ) is defined as the fundamental groupoid of the n-loop complex ⁿ (X ). Using this adjunction, we give another proof of how symmetric categorical groups model all homotopy types of spaces Y with _i (Y)=0 for all in,n+1 and n3; and also we obtain a classification theorem for those spaces: [–,Y]H ⁿ (–, _n (Y)).     

A Range-Compaction Heuristic for Graph Coloring

This paper presents a novel heuristic for graph coloring that works on a range of colors and iteratively tries to make this range more compact. This range-compaction heuristic also has a pressure component and an annealing schedule for it. The value of this component is empirically quantified. This algorithm is evaluated on a wide range of DIMACS benchmark graphs, and found to be competitive with state-of-the-art algorithms in terms of solution quality and run time.     

The Wiener-Hopf method for systems of pseudodifferential equations with an application to crack problems

The aim of this paper is to develop the Wiener-Hopf method for systems of pseudo-differential equations with non-constant coefficients and to apply it to the describtion of the asymptotic behaviour of solutions to boundary integral equations for crack problems when a crack occurs in a linear anisotropic elastic medium. The method was suggested in [15] for scalar pseudo-differential equations with constant coefficients and applied in [7] to the crack problems in the isotropic case. The existence and a-priori smoothness of solutions for the anisotropic case has been proved in [11, 12], while the isotropic case has been treated earlier in [7, 25, 41, 50]. Our results improve even those for the isotropic case obtained in [7, 50]. Asymptotic estimates for the behaviour of solutions in the anisotropic case have been obtained in [28] by a different method.In memoriam, dedicated to Professor Dr. V.D. Kupradze on the occasion of the 90th anniversary of his birthThis work was carried out during the first author's visit in Stuttgart in 1992 and supported by the DFG priority research programme Boundary Element Methods within the guest-programme We-659/19-2.     

Inducing W-graphs II

Let be the Hecke algebra associated with a Coxeter group W, and the Hecke algebra associated with W_J, a parabolic subgroup of W. In [5] an algorithm was described for the construction of a W-graph for an induced module where V is an -module derived from a W_J-graph. This note is a continuation of [5], and involves the following results:[] inducing ordered and bipartite W-graphs;[] the relationship between the cell decomposition of a W_J-graph and the cell decomposition of the corresponding induced W-graph;[] a Mackey-type formula for the restriction of an induced W-graph;[] a formula relating the polynomials used in the construction of induced W-graphs to Kazhdan-Lusztig polynomials.The result on cells is a version of a Theorem of M. Geck [4], dealing with cells in W (allowing unequal parameters).Mathematics Subject Classification (2000): Primary 20C     

Analytical and numerical solution of multi-term nonlinear differential equations of arbitrary orders

We are concerned here with a nonlinear multi-term fractional differential equation (FDE). The existence of a unique solution will be proved. Convergence analysis of Adomian decomposition method (ADM) applied to these type of equations is discussed. Convergence analysis is reliable enough to estimate the maximum absolute truncated error of Adomian’s series solution. Some numerical examples are given, their ADM solutions are compared with a numerical method solutions. This numerical method is introduced in Podlubny (Fractional Differential Equations, Chap. 8, Academic Press, San Diego, 1999).     

On some difference schemes for singular singularly-perturbed boundary value problems

Summary Singularly perturbed boundary value ordinary differential problems are considered, where the problem defining the reduced solution is singular. For numerical approximation, families of symmetric difference schemes, which are equivalent to certain collocation schemes based on Gauss and Lobatto points, are used. Convergence results, previously obtained for the regular singularly perturbed case, are extended. While Gauss schemes are extended with no change, Lobatto schemes require a small modification in the mesh selection procedure. With meshes as prescribed in the text, highly accurate solutions can be obtained with these schemes for singular singularly perturbed problems at a very reasonable cost. This is demonstrated by examples.This research was completed while the author was visiting the Department of Applied Mathematics, Weizmann Inst., Rehovot, Israel. The author was supported in part under NSERC grant A4306