Flat points of two-dimensional Brownian motion

Summary SupposeZ(·) is a two-dimensional Brownian motion. It is shown that a.s. there existt ₀ and >0 such thatZ(t ₀) is an extremal point of the convex hull of {Z(t)|t ₀–tt₀} and also an extremal point of the convex hull of {Z(t)|t ₀tt₀+} and, moreover, the tangent lines to the convex hulls atZ(t ₀) form a non-zero angle.The result is related to the following unsolved problem of S.J. Taylor. Do there exist a.s.t ₀ and >0 such that the intersection of the convex hulls of {Z(t)|t ₀–tt₀} and {Z(t)|t ₀tt₀+} contains onlyZ(t ₀)?This research was partially supported by Grant-in-Aid for Scientific Research (No. 400101540202), Ministry of Education, Science and Culture     

A Note on a Boundary Value Problem

In this note, we prove that, for Robins boundary value problem, a unique solution exists if f_x(t, x, x), f_x(t, x, x), (t), and (t) are continuous, and f_x -(t), f_x -(t), 4(t) ² + ²(t) ++ 2(t), and 4(t) ² + ²(t) + 2(t).AMS Subject Classification (2000) 34B15     

Surjectivity of quotient maps for algebraic (ℂ,+)-actions and polynomial maps with contractible fibers

In this paper we establish two results concerning algebraic (,+)-actions on ⁿ . First, let be an algebraic (,+)-action on ³. By a result of Miyanishi, its ring of invariants is isomorphic to [t ₁,t ₂]. Iff ₁,f ₂ generate this ring, the quotient map of is the mapF:³²,x(f ₁(x), f₂(x)). By using some topological arguments we prove thatF is always surjective. Secon, we are interested in dominant polynomial mapsF: ^{n n-1} whose connected components of their generic fibers are contractible. For such maps, we prove the existence of an algebraic (,+)-action on ⁿ for whichF is invariant. Moreover we give some conditions so thatF*([t ₁,...,t _n-1 ]) is the ring of invariants of .Dedicated to all my friends and my family     

Algorithm for a sum of reciprocals

An algorithm is described for the approximate calculation of a collection of sums of the form _k= _j–1 ⁿ c_j/(_j+_k), 1kn, where 0<_j. The working time of the algorithm is 0(n(t+ log n)(t+log n)) if _k calculated to within 2^–t; here the function (l) denotes the time of multiplication of twoZ-bit numbers.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 137, pp. 3–6, 1984.In conclusion, the author expresses thanks to A. O. Slisenko and Yu. A. Kuznetsov, who drew the attention of the author to the problem considered.     

On eigenvalues of perturbed quadratic matrix polynomials

Among other results, it is shown that ifC andK are arbitrary complexn×n matrices and if det( ₀ ² I₀ C+K)=0 for some ₀0 (resp. ₀=0), then the Newton diagram of the polynomialt(, ) = det(² I+(1+)C+K expanded in (–₀) and , has at least a point on or below the linex+y=b (resp. has no expanded in (–₀) and , has at least a point on or below the of 0 as an eigenvalue of ₀ ² I+₀ C+K. These are extensions of similar results deu to H. Langer, B. Najman, and K. Veseli proved for diagonable matricesC, and shed light on the eigenvalues of the perturbed quadratic matrix polynomials. Our proofs are independent and seem to be simpler     

Estimation of the Intensity of the Flow of Nonmonotone Refusals in the Queuing System (≤ λ)/G/m

We consider a queuing system ()/G/m, where the symbol () means that, independently of prehistory, the probability of arrival of a call during the time interval dtdoes not exceed dt. The case where the queue length first attains the level r m+ 1 during a busy period is called the refusal of the system. We determine a bound for the intensity ₁(t) of the flow of homogeneous events associated with the monotone refusals of the system, namely, ₁(t) = O( ^{r+ 1}₁ ^{m– 1} _{r– m+ 1}), where _k is the kth moment of the service-time distribution.     

Stability and Attraction to Normality for Lévy Processes at Zero and at Infinity

We prove some limiting results for a Lévy process X _t as t0 or t, with a view to their ultimate application in boundary crossing problems for continuous time processes. In the present paper we are mostly concerned with ideas related to relative stability and attraction to the normal distribution on the one hand and divergence to large values of the Lévy process on the other. The aim is to find analytical conditions for these kinds of behaviour which are in terms of the characteristics of the process, rather than its distribution. Some surprising results occur, especially for the case t0; for example, we may have X _t /t ^P + (t0) (weak divergence to +), whereas X _t /t a.s. (t0) is impossible (both are possible when t), and the former can occur when the negative Lévy spectral component dominates the positive, in a certain sense. Almost sure stability of X _t , i.e., X _t tending to a nonzero constant a.s. as t or as t0, after normalisation by a non-stochastic measurable function, reduces to the same type of convergence but with normalisation by t, thus is equivalent to strong law behaviour. Boundary crossing problems which are amenable to the methods we develop arise in areas such as sequential analysis and option pricing problems in finance.     

On the Heyde Theorem for Finite Abelian Groups

It is well-known Heyde's characterization theorem for the Gaussian distribution on the real line: if _j are independent random variables, _j , _j are nonzero constants such that _i ± _j ^–1 _j 0 for all i j and the conditional distribution of L ₂=_{1 1} + ··· + _{n n} given L ₁=_{1 1} + ··· + _{n n} is symmetric, then all random variables _j are Gaussian. We prove some analogs of this theorem, assuming that independent random variables take on values in a finite Abelian group X and the coefficients _j , _j are automorphisms of X.     

Fast Summation of Power Series with Coefficients Analytic at Infinity

We propose a fast summation algorithm for slowly convergent power series of the form _{j=j 0} z ^j _j j _i=1 ^s (j+ _i )^– _i , where R, _i 0 and _i C, 1is, are known parameters, and _j =(j), being a given real or complex function, analytic at infinity. Such series embody many cases treated by specific methods in the recent literature on acceleration. Our approach rests on explicit asymptotic summation, started from the efficient numerical computation of the Laurent coefficients of . The effectiveness of the resulting method, termed ASM (Asymptotic Summation Method), is shown by several numerical tests.     

Superconvergence for galerkin methods for the two point boundary problem via local projections

The two point boundary problemy'-a(x)y–b(x)y=-f(x), o<x<1,y(0)=y(1)=0, is first solved approximately by the standard Galerkin method, (Y, ) + (aY+bY, )=(f, ), ₁ ⁰ (r, ), for a function Y ₁ ⁰ (r, ), the space ofC ¹-piecewise--degree-polynomials vanishing atx=0 andx=1 and having knots at {x ₀ ,x ₁ , ...,x _M }=. ThenY is projected locally into a polynomial of higher degree by means of one of several projections. It is then shown that higher-order convergence results locally, provided thaty is locally smooth and is quasi-uniform.This research was supported in part by the National Science Foundation.