A generalization of the results of Pillai

In a recent article Pillai (1990,Ann. Inst. Statist. Math.,42, 157–161) showed that the distribution 1–E (–x ), 0<1; 0x, whereE (x) is the Mittag-Leffler function, is infinitely divisible and geometrically infinitely divisible. He also clarified the relation between this distribution and a stable distribution. In the present paper, we generalize his results by using Bernstein functions. In statistics, this generalization is important, because it gives a new characterization of geometrically infinitely divisible distributions with support in (0, ).     

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.     

Best approximation and best unilateral approximation of the kernel of a biharmonic equation and optimal renewal of the values of operators

For the classB _p , 0 < 1, 1p , of 2-periodic functions of the form f(t)=u(,t), whereu (,t) is a biharmonic function in the unit disk, we obtain the exact values of the best approximation and best unilateral approximation of the kernel K(t) of the convolution f= K *g, gl, with respect to the metric of L₁. We also consider the problem of renewal of the values of the convolution operator by using the information about the values of the boundary functions.Translated from Ukrainskii Matematicheskii Zhurnal, Vol.47, No. 11, pp. 1549–1557, November, 1995.     

Bases in the spaces C and Lp

In this paper it is proved that for any numbers A and B, 0k(x), k=1, 2, ..., whose graphs lie in the strip 0x1, AyB. It is shown that for the space L_p, p>1, there is no analogous basis in a strip theorem.Translated from Matematicheskie Zametki, Vol. 10, No. 6, pp. 635–640, December, 1971.     

Inclusion statements for operator equations by a continuity principle

The paper is concerned with Range-Domain Implications MvCvK, where M is a given operator and C,K denote given sets. Sufficient conditions are derived by a very general continuity principle. Various special cases are considered such as inverse-positivity, MvMwvw, and a generalization H(,[,])MvH(,[,]) v, where Mu=H(u,u) and [,] denotes an order interval. These results are applied to differential operators related to boundary or initial value problems. The goal is to furnish a simple uniform approach, to explain its application, and to provide a kind of survey on what problems have been treated in this way.     

Improved Krasnosel'skii theorems for the dimension of the kernel of a starshaped set

We will establish the following improved Krasnosel'skii theorems for the dimension of the kernel of a starshaped set: For each k and d, 0 k d, define f(d,k) = d+1 if k = 0 and f(d,k) = max{d+1,2d–2k+2} if 1 k d.Theorem 1. Let S be a compact, connected, locally starshaped set in R^d, S not convex. Then for a k with 0 k d, dim ker S k if and only if every f(d, k) lnc points of S are clearly visible from a common k-dimensional subset of S.Theorem 2. Let S be a nonempty compact set in R^d. Then for a k with 0 k d, dim ker S k if and only if every f (d, k) boundary points of S are clearly visible from a common k-dimensional subset of S. In each case, the number f(d, k) is best possible for every d and k.     

Connected and alternating vectors: Polyhedra and algorithms

Given a graphG = (V, E), leta ^S, S L, be the edge set incidence vectors of its nontrivial connected subgraphs.The extreme points of = {x R ^E: a^sx |V(S)| - |S|, S L} are shown to be integer 0/± 1 and characterized. They are the alternating vectorsb ^k, k K, ofG. WhenG is a tree, the extreme points ofB 0,b ^kx 1,k K} are shown to be the connected vectors ofG together with the origin. For the four LP's associated with andA, good algorithms are given and total dual integrality of andA proven.On leave from Swiss Federal Institute of Technology, Zurich.     

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.     

Two-parameter Vilenkin multipliers and a square function

Two-parameter Vilenkin systems will be investigated. First we give a general sufficient condition for multipliers to be bounded between two-dimensional Hardy spaces H ^q(0<q1). By means of interpolation and duality argument, this theorem can be extended to other spaces. As a consequence, we can prove the (H ^q , L ^q)-boundedness of the Sunouchi operator U with respect to two-parameter Vilenkin systems for all 0 <q 1. Moreover, the equivalence f{H_q} ~ Uf_q (f H^q)follows for 1/2<q 1.     

Some inequalities about the covering radius of Reed-Muller codes

Let R(r, m) be the rth order Reed-Muller code of length 2 ^m , and let (r, m) be its covering radius. We prove that if 2 k m - r - 1, then (r + k, m + k) (r, m + 2(k - 1). We also prove that if m - r 4, 2 k m - r - 1, and R(r, m) has a coset with minimal weight (r, m) which does not contain any vector of weight (r, m) + 2, then (r + k, m + k) (r, m) + 2k(. These inequalities improve repeated use of the known result (r + 1, m + 1) (r, m).This work was supported by a grant from the Research Council of Wright State University.     

A Note on Thin P-Polynomial and Dual-Thin Q-Polynomial Symmetric Association Schemes

Let Y denote a d-class symmetric association scheme, with d 3. We show the following: If Y admits a P-polynomial structure with intersection numbers p _ij ^h and Y is 1-thin with respect to at least one vertex, then p _ll ^l =0 p _li ⁱ =0 1 i - 1. If Y admits a Q-polynomial structure with Krein parameters q _ij ^h , and Y is dual 1-thin with respect to at least one vertex, then q _ll ^l = 0 q _li ⁱ = 01 i d-1.     

Einschliessungsaussagen für Differentialoperatoren vierter Ordnung und ein Verfahren zur Berechnung von Schrankenfunktionen

For a linear fourth order ordinary differential operator M we study Range Domain Implications (RDI). Let C_o [O,1] be positive; we show under what conditions there exists a C_O[O,1] such that the following RDI holds: Mu(x) (x) (0x1) u(x) (0x1). In particular we provide a numerical procedure to calculate .RDI are used to obtain error estimations and to solve related nonlinear problems.The basic idea to prove RDI is to split M into a product of second order differential operators which are easier to handle. For the general case that there exists no global splitting the concept of a local splitting is introduced.

---

---

The author would like to thank the European Research Office of the United States Army for their kind interest.     

Approximation of Classes B p,θ r by Linear Methods and Best Approximations

We investigate problems related to the approximation by linear methods and the best approximations of the classes , 1 p in the space L .     

A symmetry problem in the calculus of variations

Let be a ball in ^N, centered at zero, and letu be a minimizer of the nonconvex functional over one of the classesC _M := {w W _loc ^1, () 0 w(x) M in,w concave} orE _M := {w W _loc ^1,2 () 0 w(x) M in,w 0 inL()}of admissible functions. Thenu is not radial and not unique. Therefore one can further reduce the resistance of Newton's rotational body of minimal resistance through symmetry breaking.     

Identification of the Parameters of a Multivariate Normal Vector by the Distribution of the Maximum

This paper continues the work started by Basu and Ghosh (J. Mult. Anal. (1978), 8, 413–429), by Gilliland and Hannan (J. Amer. Stat. Assoc. (1980), 75, No. 371, 651–654), and then continued on by Mukherjea and Stephens (Prob. Theory and Rel. Fields (1990), 84, 289–296), and Elnaggar and Mukherjea (J. Stat. Planning and Inference (1990), 78, 23–37). Let (X₁, X₂,..., X_n) be a multivariate normal vector with zero means, a common correlation and variances ² ₁, ² ₂,..., ² _n such that the parameters , ² ₁, ² ₂,..., s² _n are unknown, but the distribution of the max{X_i: 1in} (or equivalently, the distribution of the min{X_i: 1in}) is known. The problem is whether the parameters are identifiable and then how to determine the (unknown) parameters in terms of the distribution of the maximum (or its density). Here, we solve this problem for general n. Earlier, this problem was considered only for n3. Identifiability problems in related contexts were considered earlier by numerous authors including: T. W. Anderson and S. G. Ghurye, A. A. Tsiatis, H. A. David, S. M. Berman, A. Nadas, and many others. We also consider here the case where the X_i's have a common covariance instead of a common correlation.     

Local isometric immersions of two-dimensional metrics inE 4 with prescribed Gaussian torsion

Suppose that in a domain R(, B) of variables (r, ): (0 r , ₁ +B(r–r ₀ ) ₂–B(r–r₀), where > 0, B > 0, ₁ < 0 < ₂ are numbers) a metric ds² = dr² +G(r, )d ² and a function k(r, ) are given. The problem of isometrically immersing ds² in E ⁴ with prescribed Gaussian torsion is considered. The following is proved: The class C ⁵ metric ds ² is locally realized in the form of a class C ³ surface F ² whose Gaussian torsion is the prescribed class C ³ function (r, ).Translated from Ukrainskii Geometricheskii Sbornik, No. 35, pp. 38–47, 1992.     

Eine Charakterisierung unendlich oft teilbarer Verteilungen auf [0, ∞)

A function : [0, )(-,0] is the logarithm of the Laplace transform of an infinitely divisible probability measure on [0,) if and only if (0)=0, is continuous and conditionally positiv semi-definite.     

Best Linear Methods of Approximation of Functions of the Hardy Class H p

We determine the exact value of the best linear polynomial approximation of a unit ball of the Hardy space H _p, 1 p , on concentric circles , 0 < 1, in the uniform metric. We construct the best linear method of approximation and prove the uniqueness of this method.     

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.     

Cones in the space Lp (1 ≤ p ≤ ∞) and minimax problems of mathematical statistics

The structure of cones in the spaces L_p(l p ) and their application to minimax problems of statistical assumptions are considered.Translated from Staticheskie Metody, pp. 28–30, 1978.