Some fractal sets determined by stable processes

Summary LetY _i be independent stable subordinators in (, ,P) with indices 0< _i <1 andR _i are the ranges ofY _i ,i=1, 2. We are able to find the exact Hausdorff measure and packing measure results for the product setsR ₁×R ₂, and whenever ₁ + ₂ 1/2, we deduce results for the vector sumR ₁R ₂={x+y:xR ₁,yR ₂}.     

A functional inequality for real-analytic functions

Summary Forf ( C ⁿ() and 0 t x letJ _n (f, t, x) = (–1)ⁿ f(–x)f ⁽ⁿ⁾(t) +f(x)f ⁽ⁿ⁾ (–t). We prove that the only real-analytic functions satisfyingJ _n (f, t, x) 0 for alln = 0, 1, 2, are the exponential functionsf(x) = c e ^x,c, . Further we present a nontrivial class of real-analytic functions satisfying the inequalitiesJ ₀ (f, x, x) 0 and ₀ ^x (x – t)^{n – 1}J_n(f, t, x)dt 0 (n 1).     

An implicit function theorem

Suppose thatF:DR ⁿ×R^mRⁿ, withF(x ⁰,y ⁰)=0. The classical implicit function theorem requires thatF is differentiable with respect tox and moreover that ₁ F(x ⁰,y ⁰) is nonsingular. We strengthen this theorem by removing the nonsingularity and differentiability requirements and by replacing them with a one-to-one condition onF as a function ofx.     

Necessary and sufficient conditions for the convergence of convolution products of non-identical distributions on finite abelian semigroups

Given a sequence of probability measures ( _n ) on a finite abelian semigroup, we present necessary and sufficient conditions which guarantee the weak convergence of the convolution products _{k,n k+1}*···* _n (k<n), asn for allk0. These conditions are verifiable in the sense that they are based entirely on the individual measures in the sequence ( _n ).     

Approximation of the viability kernel

We study recursive inclusionsx ⁿ⁺¹ G(x ⁿ ). For instance, such systems appear for discrete finite-difference inclusionsx ⁿ⁺¹ G (x ⁿ) whereG :=1+F. The discrete viability kernel ofG , i.e., the largest discrete viability domain, can be an internal approximation of the viability kernel ofK underF. We study discrete and finite dynamical systems. In the Lipschitz case we get a generalization to differential inclusions of the Euler and Runge-Kutta methods. We prove first that the viability kernel ofK underF can be approached by a sequence of discrete viability kernels associated withx ⁿ⁺¹ (xⁿ) where (x) =x + F(x) + (ML/2) ². Secondly, we show that it can be approached by finite viability kernels associated withx _h ⁿ⁺¹ ( (x _h ⁿ⁺¹ ) +(h) X _h .     

Sur les équations fonctionnelles auxq-différences

Summary In this paper, we study the convergence of formal power series solutions of functional equations of the formP _k(x)(^[k](x))=(x), where ^[k] (x) denotes thek-th iterate of the function.We obtain results similar to the results of Malgrange and Ramis for formal solutions of differential equations: if(0) = 0, and(0) =q is a nonzero complex number with absolute value less than one then, if(x)=a(n)x ⁿ is a divergent solution, there exists a positive real numbers such that the power seriesa(n)q ^sn(n+1)2 x ⁿ has a finite and nonzero radius of convergence.

     

A property of a system of functions close to exponential functions

We consider the system {f _n=xⁿ[l+_n]} in the interval [a,b] (0 a n > 0 and _n(x) such as the condition, we obtain a bound for the coefficients of the polynomial P(x)=#x2211;c_n f _n(x) in terms of P(x)L_p[a,b]. It is found that this bound is not valid without this condition (assuming the other conditions to remain the same).Translated from Matematicheskie Zametki, Vol. 12, No. 1, pp. 29–36, July, 1972.     

A new continuation method for complementarity problems with uniformP-functions

The complementarity problem with a nonlinear continuous mappingf from the nonnegative orthantR ₊ ⁿ ofR ⁿ intoR ⁿ can be written as the system of equationsF(x, y) = 0 and(x, y) R ₊ ²ⁿ , whereF denotes the mapping from the nonnegative orthantR ₊ ²ⁿ ofR ²ⁿ intoR ₊ ⁿ × Rⁿ defined byF(x, y) = (x ₁y₁,,x_ny_n, f₁(x) – y₁,, f_n(x) – y_n) for every(x, y) R ₊ ²ⁿ . Under the assumption thatf is a uniformP-function, this paper establishes that the mappingF is a homeomorphism ofR ₊ ²ⁿ ontoR ₊ ⁿ × Rⁿ. This result provides a theoretical basis for a new continuation method of tracing the solution curve of the one parameter family of systems of equationsF(x, y) = tF(x ⁰, y⁰) and(x, y) R ₊ ²ⁿ from an arbitrary initial point(x ⁰, y⁰) R ₊ ²ⁿ witht = 1 until the parametert attains 0. This approach is an extension of the one used in the polynomially bounded algorithm recently given by Kojima, Mizuno and Yoshise for solving linear complementarity problems with positive semi-definite matrices.     

Isotropic random walks in a tree

Summary Let T be an infinite homogeneous tree of order a+1. We study Markov chains {X _n} in T whose transition functions p(x, y)=A[d(x,y)] depend only on the shortest distance between x and y in the graph. The graph T can be represented as a symmetric space of a p-adic matrix group; we prove a series of results using essentially the spherical functions of this symmetric space. Theorem 1. d(X _n,x) n a.s., where >0 if A(0) 1, X ₀=x. Assuming {X _n} is strongly aperiodic, Theorem 2. p ₂(x, y)CRⁿ/n^3/2 for fixed x, y where R=(d) A(d)<1, and if E[d(X₁, X₀)²]<, Theorem 3. R(1–u, x, y) = (1–u)ⁿp_n(x, y)=Ca^–d[exp(–du/)+o_d(1)] as d=d(x,y) uniformly for 0u2. Using Theorem 3, we calculate the Martin boundary Dirichlet kernel of p(x, y) on T, which turns out to be independent of {itA(d)}. We also consider a stepping-stone model of a randomly-mating-and-migrating population on the nodes of T. If initially all individuals are distinct, then in generation n approximately half of the individuals of a given type are within n of a typical one and essentially all are within 2n.This work was partially supported by the National Science Foundation under grant number MCS 75-08098-A01For the academic year 1977–78: Department of Mathematics GN-50, University of Washington, Seattle, Washington 98195 USA     

Kite-freeP- andQ-polynomial schemes

LetY = (X, {R _i } _oid) denote aP-polynomial association scheme. By a kite of lengthi (2 i d) inY, we mean a 4-tuplexyzu (x, y, z, u X) such that(x, y) R ₁,(x, z) R ₁,(y, z) R ₁,(u, y) R _i–1,(u, z) R _i–1,(u, x) R _i. Our main result in this paper is the following.     

Symmetrische Permutationsmengen

A permutation set (M, I) consisting of a setM and a set of permutations ofM, is calledsymmetric, if for any two permutations, the existence of anx M with (x) (x) and ^–1 (x) = ^–1 (x) implies ^–1 = ^–1 , andsharply 3-transitive, if for any two triples (x ₁,x ₂,x ₃), (y ₁,y ₂,y ₃) M ³ with|{x ₁,x ₂,x ₃ }| = |{y ₁,y ₂,y ₃ }| = 3 there is exactly one permutation with(x ₁) =y ₁,(x ₂) =y ₂,(x ₃) =y ₃. The following theorem will be proved.THEOREM.Let (M, ) be a sharply 3-transitive symmetric permutation set with |M|3, such that contains the identity. Then is a group and there is a commutative field K such that and the projective linear group PGL(2, K) are isomorphic.     

Weak solutions of the Stokes problem in weighted Sobolev spaces

For n2 we consider the Stokes problem in ⁿ, -u + p=f, -divu=g, in weighted Soboiev spaces H ₆ ^m,r , where the weights are proportional to (1+|x|). We prove the existence of weak solutions for any K, whereK is a discrete set of critical values. Furthermore, we characterize the solutions of the homogeneous problem.This research was supported by the DFG research group Equations of Hydrodynamics, Universities of Bayreuth and Paderborn.     

Bestimmung der Eigenwerte und Eigenvektoren einer Matrix mit Hilfe des Quotienten-Differenzen-Algorithmus

Summary Two previous papers (in Vol. V) describe theory and some applications of the quotient-difference (=QD-) algorithm. Here we give an extension which allows the determination of the eigenvectors of a matrix. Letx ₍₀₎ ¹ , ...,x ₍₀₎ ⁿ be a coordinate system in whichA has Jacobi form (such a system may be constructed with methods ofC. Lanczos orW. Givens). Then the QD-algorithm allows the construction of a sequence of coordinate systemsx ₍₂₎ ¹ , ...,x ₍₂₎ ⁿ , (=0, 1, 2, ...) which converge for to the system of the eigenvectors ofA.     

Bounds of eigenvalues of a graph

LetG be a simple graph withn vertices. We denote by _i(G) thei-th largest eigenvalue ofG. In this paper, several results are presented concerning bounds on the eigenvalues ofG. In particular, it is shown that –1₂(G)(n–2)/2, and the left hand equality holds if and only ifG is a complete graph with at least two vertices; the right hand equality holds if and only ifn is even andG2K _n/2.     

On a theorem of J. Vukman

Summary LetR be a ring. A bi-additive symmetric mappingD:R × R R is called a symmetric bi-derivation if, for any fixedy R, the mappingx D(x, y) is a derivation. J. Vukman [2, Theorem 2] proved that, ifR is a non-commutative prime ring of characteristic not two and three, and ifD:R × R R is a symmetric bi-derivation such that [D(x, x), x] lies in the center ofR for allx R, thenD = 0. This result is in the spirit of the well-known theorem of Posner [1, Theorem 2], which states that the existence of a nonzero derivationd on a prime ringR, such that [d(x), x] lies in the center ofR for allx R, forcesR to be commutative. In this paper we generalize the result of J. Vukman mentioned above to nonzero two-sided ideals of prime rings of characteristic not two and we prove the following. Theorem.Let R be a non-commutative prime ring of characteristic different from two, and I a nonzero two-sided ideal of R. Let D: R × R R be a symmetric bi-derivation. If [D(x, x), x] lies in the center of R for all x I, then D = 0.     

The Ramsey property for collections of sequences not containing all arithmetic progressions

A family of sequences has the Ramsey property if for every positive integerk, there exists a least positive integerf (k) such that for every 2-coloring of {1,2, ...,f (k)} there is a monochromatick-term member of . For fixed integersm > 1 and 0 q < m, let _q(m) be the collection of those increasing sequences of positive integers {x ₁,..., x_k} such thatx _i+1 – x_i q(modm) for 1 i k – 1. Fort a fixed positive integer, denote byA _t the collection of those arithmetic progressions having constant differencet. Landman and Long showed that for allm 2 and 1 q < m, _q(m) does not have the Ramsey property, while _q(m) A _m does. We extend these results to various finite unions of _q(m) 's andA _t 's. We show that for allm 2, _q=1 ^m–1 _q(m) does not have the Ramsey property. We give necessary and sufficient conditions for collections of the form _q(m) ( _{t T} A _t) to have the Ramsey property. We determine when collections of the form _a(m₁) _b(m₂) have the Ramsey property. We extend this to the study of arbitrary finite unions of _q(m)'s. In all cases considered for which has the Ramsey property, upper bounds are given forf .     

Almost everywhere convergence of the spherical partial sums for radial functions

LetfL ^p( ⁿ ),n2, be a radial function and letS _Rf be the spherical partial sums operator. We prove that if thenS _Rf(x)f(x) a.e. asR. The result is false for and \frac{{2n}}{{n + 1}}$$ " align="middle" border="0"> .Partially supported by M.P.I.     

Randomly Weighted Sums of Subexponential Random Variables with Application to Ruin Theory

Let {X _k , 1 k n} be n independent and real-valued random variables with common subexponential distribution function, and let {k, 1 k n} be other n random variables independent of {X _k , 1 k n} and satisfying a _k b for some 0 < a b < for all 1 k n. This paper proves that the asymptotic relations P (max_{1 m n k=1} ^m _k X _k > x) P (sum _k=1 ⁿ _k X _k > x) sum _k=1 ⁿ P ( _k X _k > x) hold as x . In doing so, no any assumption is made on the dependence structure of the sequence { _k , 1 k n}. An application to ruin theory is proposed.     

The Logarithmic Frequency of Values of Additive Functions

We consider the weak convergence of distribution functions (_mx 1/ m)^-1 _{m x},f_x(m)x is a set (x 2) of strongly additive functions such that f_x(p){0,1} for each prime number p.     

Convergence of random products of compact contractions in Hilbert space

Let {T₁, ..., T_N} be a finite set of linear contraction mappings of a Hilbert space H into itself, and let r be a mapping from the natural numbers N to {1, ..., N}. One can form S_n=T_r(n)...T_r(1) which could be described as a random product of the T_i's. Roughly, the S_n converge strongly in the mean, but additional side conditions are necessary to ensure uniform, strong or weak convergence. We examine contractions with three such conditions. (W): x_n1, Tx_n1 implies (I-T)x_n0 weakly, (S): x_n1, Tx_n1 implies (I-T)x_n0 strongly, and (K): there exists a constant K>0 such that for all x, (I-T)x²K(x²–Tx²).We have three main results in the event that the T_i's are compact contractions. First, if r assumes each value infinitely often, then S_n converges uniformly to the projection Q on the subspace _i= ₁ ^N [x|T_ix=x]. Secondly we prove that for such compact contractions, the three conditions (W), (S), and (K) are equivalent. Finally if S=S(T₁, ..., T_N) denotes the algebraic semigroup generated by the T_i's, then there exists a fixed positive constant K such that each element in S satisfies (K) with that K.