The Discrete Spectrum Asymptotics with Respect to a Large Coupling Constant under Strong Nonnegative Perturbations

Let A be a self-adjoint operator, let (, ) be an inner gap in the spectrum of the operator A, and let B(t) = A + tW ^* W, where the operator W(A – iI)^-1 is not necessarily bounded. Conditions are obtained under which the spectrum of B(t) in (, ) is discrete. Let N(, A, W, ), (, ), > 0, be the number of eigenvalues of the operator B(t) passing the point (, ) as t increases from 0 to . The asymptotics of N(, A, W, ) as + is obtained in terms of the spectral asymptotics of a certain self-adjoint compact operator. Bibliography: 5 titles.     

Positive Solutions for a Singular Nonlinear Problem on a Bounded Domain in R 2

For a bounded regular Jordan domain in R ², we introduce and study a new class of functions K() related on its Green function G. We exploit the properties of this class to prove the existence and the uniqueness of a positive solution for the singular nonlinear elliptic equation u+(x,u)=0, in D(), with u=0 on and uC(), where is a nonnegative Borel measurable function in ×(0,) that belongs to a convex cone which contains, in particular, all functions (x,t)=q(x)t ^–,>0 with nonnegative functions qK(). Some estimates on the solution are also given.     

Constraint decomposition algorithms in global optimization

Many global optimization problems can be formulated in the form min{c(x, y): x X, y Y, (x, y) Z, y G} where X, Y are polytopes in ^p , ⁿ , respectively, Z is a closed convex set in ^p+n, while G is the complement of an open convex set in ⁿ . The function c: ^p+n is assumed to be linear. Using the fact that the nonconvex constraints depend only upon they-variables, we modify and combine basic global optimization techniques such that some new decomposition methods result which involve global optimization procedures only in ⁿ . Computational experiments show that the resulting algorithms work well for problems with smalln.     

Stability of Bounded Solutions of Differential Equations with Small Parameter in a Banach Space

For a sectorial operator A with spectrum (A) that acts in a complex Banach space B, we prove that the condition (A) i R = Ø is sufficient for the differential equation where is a small positive parameter, to have a unique bounded solution x for an arbitrary bounded function f: R B that satisfies a certain Hölder condition. We also establish that bounded solutions of these equations converge uniformly on R as 0+ to the unique bounded solution of the differential equation x(t) = Ax(t) + f(t).     

On the asymptotic behavior of an unstable solution of an inhomogeneous stochastic diffusion equation

Sufficient conditions are obtained for the normalized trajectories of an unstable solution of the one-dimensional Itô stochastic differential equation with coefficientsa(t, x) and(t, x) to coincide with the normalized trajectories of the solution of the equation with coefficientsa(x) and(x) ast assuming that the coefficientsa(t, x) and(t, x) have a certain average closeness to the coefficientsa(x) and(x) over time ast.Translated fromTeoriya Sluchaínykh Protsessov, Vol. 15, pp. 3–10, 1987.     

A chord-stretching map of a convex loop is an isometry

Let ⁿ be n-dimensional Euclidean space, and let : [0, L] ⁿ and : [0, L] ⁿ be closed rectifiable arcs in ⁿ of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C ² curves. In this paper we prove the conjecture in general.     

On some problems of interpolation by ℒ-splines

_n (D) — ,s — _n (D), _v (v=1, 2, ...,s/2) — . _m={0x ₀<x ₁<...<x _2m–1<2,x _2m =x ₀+2} , x _j +1–x _j <(4s max _v )^–1,j=0, 1, ..., 2m –1, ( ) 2- - _n,m 2m , _m . , L _q - (1q) W ( _n )={f ₂ :f ^(n–1)AC ₂ , _n (D)f 1} 2- - (s _n f), _m . , - - _n,m .

---

---

The author expresses his gratitude to Yu. N. Subbotin for a useful discussion on the results of this paper.     

An infinite dimensional analogue of the Albeverio-Röckner's theorem on Fukushima's conjecture

LetX be the solution of the SDE:dX _t = (X _t)dB _t +b(X _t)dt, with andb C _b (R) such that >0 for some constant , andB a real Brownian motion. Let be the law ofX onE=C([0, 1],R) andk E* – {0}, whereE* is the topological dual space ofE. Consider the classical form: _k (u, v)=u / kv / kd, whereu andv are smooth functions onE. We prove that, if _k is closable for anyk in a dense subset ofE* and if the smooth functions are contained in the domain of the generator of the closure of _k , must be a constant function.     

Formulating Measure Differential Inclusions in Infinite Dimensions

Measure differential inclusions were introduced by J. J. Moreau to study sweeping processes, and have since been used to study rigid body dynamics and impulsive control problems. The basic formulation of an MDI is d / d (t) K(t) where is a vector measure, an unsigned measure, and K() is a set-valued map with closed, convex values and is hemicontinuous. Note that need not be absolutely continuous with respect to . Stewart extended Moreau's original concept (which applied only to cone-valued K()) to general convex sets, and gave strong and weak formulations of d / d (t) K(t) where K(t) R ⁿ . Here the strong and weak formulations of Stewart are extended to infinite-dimensional problems where K(t) X where X is a separable reflexive Banach space; they are shown to be equivalent under mild assumptions on K().     

Chaotic solutions of systems with almost periodic forcing

Summary In a recent paper [J. Diff. Equat. 55 (2) (1984), 225–256], J. Palmer proved Smale's theorem on the embedding of the Bernoulli shift in the context of a periodic differential system (^*) =f (t, x),x ⁿ , using a nonautonomous shadow lemma. By means of this lemma, we show that one does get a similar kind of chaotic motion whenf is almost periodic int. Actually, we do not consider the equation (^*). In order to show that the hypotheses can be satisfied, we rather consider a parameter-dependent equation of the formx=g(x)+h(t,x,), whereIR is the parameter.

---

Zusammenfassung In einer kürzlich erschienenen Arbeit [J. Diff. Equat. 55 (2) (1984), 225–256] bewies J. Palmer den Satz von Smale über die Einbettung des Bernoullischifts für periodische Differentialgleichungssysteme der Form (^*) =f (t, x),x ⁿ , unter Verwendung eines Schattenlemmas für nicht-autonome Systeme. Mit Hilfe dieses Lemmas zeigen wir, daß man eine ähnliche chaotische Bewegung erhält, wennf fast-periodisch int ist. Genau genommen betrachten wir nicht die Gleichung (^*). Um zu zeigen, daß die Voraussetzungen erfüllt werden können, betrachten wir vielmehr eine parameterabhängige Gleichung der Form =g(x)+h(t,x,), wobeiIR der Parameter ist.

     

On a zero-crossing probability

Let {X(t), 0E{exp (–sX(t))}=exp (–t(s)), where (s)=(1–(s)), is the intensity of the Poisson process, and (s) is the Laplace transform of the distribution of nonnegative jumps. Consider the zero-crossing probability =P{X(t)–t=0 for some t,0<t<}. We show that =() where is the largest nonnegative root of the equation (s)=s. It is conjectured that this result holds more generally for any stochastic process with stationary independent increments and with sample paths that are nondecreasing step functions vanishing at 0.     

Study of a filtration expanded to include an honest time

Summary Let (,, P) be a measurable space, and { _t} be a filtration on (,). Then, given a fixed honest timeL a new filtrationG _t} is defined, the smallest containing { _t} and for whichL is a stopping time, and the martingales, semimartingales and stopping times of this new filtration are characterised.     

On the distribution of square-full and cube-full integers

LetN _r (x) be the number ofr-full integers x and let _r (x) be the error term in the asymptotic formula forN _r (x). Under Riemann's hypothesis, we prove the estimates ₂(x)x^1/7+, ₃(x)x^97/804+(>0), which improve those of Cao and Nowak. We also investigate the distribution ofr-full andl-free numbers in short intervals (r=2,3). Our results sharpen Krätzel's estimates.     

On Riesz means with respect to a cylindric distance function

(1–) ₊ , — R ⁿ =R ^j ×R ^k , ()=max{¦ ₁¦, ¦ ₁¦},=( ₁, ₂), ₁R ^J , ₂R ^k ,j,k1,n=j+k. n=3 , (1–) ₊ [L ¹(R ⁿ )]¹, >1/2; j=4, (1–) ₊ R L ^p (R ⁿ ). .

---

---

The author would like to thank Professor W. Trebels for encouragement and valuable advice.     

Die Weingarten-Regelflächen

Referring to articles of BELTRAMI (1865), DINI (1866) and CHARIAR (1978), but using a completely different approach, we determine allruled surfaces in Euclidean space ³, which are (at leastlocally) WEINGARTEN —-surfaces under theminimal assumption C². Theskew ruled WEINGARTEN —surfaces can be characterized by havingconstant invariants d O (parameter of distribution), k (skewness of distribution) and (striction angle); theirfunctional (WEINGARTEN-)relation between the mean curvature H and the Gaussian curvature K of is of the form H= (-K)^1/4 + (-K)^3/4 with arbitrary real constants ,. These facts allow various geometric interpretations.

---

---

Herrn Prof. Dr. Oswald Giering zum 60. Geburtstag gewidmet     

On the Solvability and Asymptotics of Solutions of One Functional Differential Equation with Singularity

We prove the existence of continuously differentiable solutions with required asymptotic properties as t +0 and determine the number of solutions of the following Cauchy problem for a functional differential equation:

Join operations in vector spaces

LetX be a vector space over a totally ordered fieldF and a subset ofF. Necessary and sufficient conditions are obtained on for a join defined bya·b={a+(1–)b|} to make (X,·) (i) a convexity space (ii) a join system and (iii) a join space. For (X,·) to be a convexity space is necessarily the set of elements between 0 and 1 for some ordered subfield ofF. In this setting join systems and join spaces are essentially the same but they remain quite distinct from convexity spaces.     

Multiple wiener integrals and nonlinear functionals of a nuclear space valued Wiener process

In this work we develop techniques for the study of nonlinear functionals of a -valued Wiener processW _t, where is the dual of a countably Hilbert nuclear space. We construct stochastic integrals and multiple Wiener integrals of operator-valued processes with respect toW _t. The Wiener decomposition of the space of -valued nonlinear functionals ofW _t is established. We also obtain multiple stochastic integral expansions and representations of -valued nonlinear functionals ofW _t as operator-valued stochastic integrals of Itô type.This research was partially supported by CONACYT grants 22537 and PCEXCNA-040651, and Air Force Office of Scientific Research No. F49620 85 C 0144.Presently at CIMAT, A.P. 402 Guanajuato 36000, GTO, México.     

Some remarks on the modulus of continuity of a conformal mapping of the disk onto a Jordan domain

Letd(;z, t) be the smallest diameter of the arcs of a Jordan curve with endsz andt. Consider the rapidity of decreasing ofd(;)=sup{d(;z, t):z, t , ¦z–t¦} (as 0,0) as a measure of nicety of . Letg(x) (x0) be a continuous and nondecreasing function such thatg(x)x,g(0)=0. Put¯g(x)=g(x)+x, h(x)=(¯g(x))². LetH(x) be an arbitrary primitive of 1/h ^–1(x). Note that the functionH ^–1 x is positive and increasing on (–, +),H ^–1 0 asx– andH ^–1+ asx +. The following statement is proved in the paper.Translated fromMatematicheskie Zametki, Vol. 60, No. 2, pp. 176–184, August, 1996.This research was supported by the Russian Foundation for Basic Research under grant No. 93-01-00236 and by the International Science Foundation under grant No. NCF000.     

Linear programming by minimizing distances

To solve the linear program (LP): minimizec ^T l subject toA l+b0, for ann×d-matrixA, ann-vectorb and ad-vectorc, the positive orthantS and the planeE(t) are defined by S={(x₁,x)ⁿ⁺¹ ¦(x₁,x)0}, E(t)={(x₁,x)ⁿ⁺¹¦x₁=–c ^c l+t, x=Al+b}. First a geometric algorithm is given to determine d(E(t),S) for fixedt, where d(·,·) denotes euclidean distance. This algorithm is used to construct a second algorithm to find the minimalt with E(t) S , and thus solve LP. It is shown that all algorithms are finite.