Preparation and characterization of Fully stoichiometric SrCoO3 by electrochemical oxidation

A nearly stoichiometric SrCoO₃ phase had been prepared up to now only using high oxygen pressure. A new method for preparing fully stoichiometric SrCoO₃ has been proposed using electrochemical oxidation. Brownmillerite-type SrCoO_2.50 is oxidized into a completely stoichiometric perovskite at a potential of 500 mV for 180 hours at room temperature in alkaline media (1 M KOH). The oxidized phase has a cubic unit cell (a=383.5 pm). It is metallic and, at temperatures below T=280 K, it shows ferromagnetic behavior. The magnetic moment at 0 K is 2.1 μ_B. The physical properties of SrCoO_3.00 have been explained in terms of partial occupancy of a σ*e band.     

Enantioselective synthesis of hydroxy-substituted α-methyl-α-amino acids using Al and Mn derivatives of cyclo-(L-Ala-L-AIa) bis-Iactim ethers

Aluminum and manganese derivatives of lithiated bis-lactim ethers of cyclo-(L-Ala-L-Ala) were used for the enantioselective synthesis of -hydroxy and polyhydroxy -amino acids of the 2-methyIserine series. A new variant of the synthesis of these acids via 3-acyl-2, 5-dialkoxy-3, 6-dimethyl-3, 6-dihydropyrazines is proposed.Translated fromIzvestiya Akademii Nauk. Seriya Khimicheskaya, No. 3, pp. 590–595, March, 1993.     

Perturbation analysis of the orthogonal procrustes problem

Given two arbitrary real matricesA andB of the same size, the orthogonal Procrustes problem is to find an orthogonal matrixM such that the Frobenius norm MA – B is minimized. This paper treats the common case when the orthogonal matrixM is required to have a positive determinant. The stability of the problem is studied and supremum results for the perturbation bounds are derived.     

Sensitivity analysis of the greatest eigenvalue of a symmetric matrix via the ɛ-subdifferential of the associated convex quadratic form

LetA(·) be ann × n symmetric affine matrix-valued function of a parameteruR ^m , and let (u) be the greatest eigenvalue ofA(u). Recently, there has been interest in calculating (u), the subdifferential of atu, which is useful for both the construction of efficient algorithms for the minimization of (u) and the sensitivity analysis of (u), namely, the perturbation theory of (u). In this paper, more generally, we investigate the Legendre-Fenchel conjugate function of (·) and the -subdifferential (u) of atu. Then, we discuss relations between the set (u) and some perturbation bounds for (u).The author is deeply indebted to Professor J. B. Hiriart-Urruty who suggested this study and provided helpful advice and constant encouragement. The author also thanks the referees and the editors for their substantial help in the improvement of this paper.     

Perturbed unstable variational inequalities with unbounded operators on approximately given sets

The stability and convergence of the solutions of perturbed and regularized variational inequality to the solutions of the primary (unstable a priori) variational inequality with proper monotone operator are investigated. All the objects of inequality: the operatorA, the right-hand partf and the set of constrains are to be perturbed. At the same time no assumptions of boundedness and smoothness of the operatorA are used. The connection between the parameters of perturbations, which guarantees strong convergence of approximate solutions, is established. It is proved that the existence of the solution to the unperturbed variational inequality is necessary and sufficient condition for convergence of the regularized perturbed inequality solutions.This research was supported in part by the Ministry of Science Grant 3481-1-91 and by the Ministry of Absorption Center for Absorption in Science.     

The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

On the integersn for which Ω(n)=k (II)

Let (n) be the number of prime divisors ofn, counted with multiplicity. We denote byS(x, k) the set of thenx for which (n)=k, and byV _p(n) the exponent of the primep in the factorization ofn. In a previous paper we proved a result which implies that, ify=x/2 ^k tends to infinity withk>2loglogx where >1, then the distribution of the numbers on the setS(x, k) converges to the normal distribution of Gauss. Here, besides a slight improvement of that result, we give, for the moment of orderq of the above mentioned distribution, a formula which holds uniformly for 2loglogxklog (x/3)/log2 where 1<<3/2.     

An application of Shoenfield's absoluteness theorem to the theory of uniform distribution

IfC is a Polish probability space, a Borel set whose sectionsW _x ( have measure one and are decreasing , then we show that the set _x W _x has measure one. We give two proofs of this theorem—one in the language of set theory, the other in the language of probability theory, and we apply the theorem to a question on completely uniformly distributed sequences.Supported by DFG grant Ko 490/7-1.     

Existence and uniqueness of semimartingale reflecting Brownian motions in an orthant

Summary This work is concerned with the existence and uniqueness of a class of semimartingale reflecting Brownian motions which live in the non-negative orthant of ^d . Loosely speaking, such a process has a semimartingale decomposition such that in the interior of the orthant the process behaves like a Brownian motion with a constant drift and covariance matrix, and at each of the (d-1)-dimensional faces that form the boundary of the orthant, the bounded variation part of the process increases in a given direction (constant for any particular face) so as to confine the process to the orthant. For historical reasons, this pushing at the boundary is called instantaneous reflection. In 1988, Reiman and Williams proved that a necessary condition for the existence of such a semimartingale reflecting Brownian motion (SRBM) is that the reflection matrix formed by the directions of reflection be completely-L. In this work we prove that condition is sufficient for the existence of an SRBM and that the SRBM is unique in law. It follows from the uniqueness that an SRBM defines a strong Markov process. Our results have potential application to the study of diffusions arising as approximations tomulti-class queueing networks.Research supported in part by NSF Grants DMS 8657483, 8722351 and 9023335, and a grant from AT&T Bell Labs. In addition, R.J. Williams was supported in part during the period of this research by an Alfred P. Sloan Research Fellowship     

Random walk on the infinite cluster of the percolation model

Summary We consider random walk on the infinite cluster of bond percolation on ^d . We show that, in the supercritical regime whend3, this random walk is a.s. transient. This conclusion is achieved by considering the infinite percolation cluster as a random electrical network in which each open edge has unit resistance. It is proved that the effective resistance of this network between a nominated point and the points at infinity is almost surely finite.G.R.G. acknowledges support from Cornell University, and also partial support by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell UniversityH.K. was supported in part by the N.S.F. through a grant to Cornell University