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.     

On context patterns associated with concept lattices

In this paper, we consider the following reconstruction problem: Given two ordered sets (G, ) and (M, ) representing join- and meet-irreducible elements, respectively together with three relationsJ,, onG×M modelling comparability (gm) and maximal noncomparability with respect tog (gm, butgm*) and with respect tom (gm, butgm*). We determine necessary and sufficient conditions for the existence of a finite latticeL and injections :GJ(L) and :MM(L) such that the given order relations and the abstract relations coincide with the one induced by the latticeL.     

Asymptotic behavior of the dwell time distribution for a random walk on a positive semi-axis

Let ₁, ₂, ... be a sequence of independent identically distributed random variables with zero means. We consider the functional _n = _k=o ⁿ (S _k ) where S₁=0, S_k= _i=1 ^k _i (k1) and(x)=1 for x0,(x) = 0 for x<0. It is readily seen that _n is the time spent by the random walk S_n, n0, on the positive semi-axis after n steps. For the simplest walk the asymptotics of the distribution P (_n = k) for n and k, as well as for k = O(n) and k/n<1, was studied in [1]. In this paper we obtain the asymptotic expansions in powers of n^–1 of the probabilities P(h_n = nx) and P(nx_{1 n} nx₂) for 0<₁, x = k/n ₂<1, 0<₁x₁2₂<1.Translated from Matematicheskie Zametki, Vol. 15, No. 4, pp. 613–620, April, 1974.The author wishes to thank B. A. Rogozin for valuable discussions in the course of his work.     

On the rank of a spectral function

Let P(x), 0 x 1, be an absolutely continuous spectral function in the separable Hilbert spacesS. If the vectors h_j, j=1, 2, ..., s; s are such that the set P(x)h_j is complete inS, then the rank of the function P(x) equals the general rank of the matrix-function d/dxP(x)h_i,h_js₁.Translated from Matematicheskie Zametki, Vol. 5, No. 4, pp. 457–460, April, 1969.     

Order of the best spline approximations of some classes of functions

The rate of decrease of the upper bounds of the best spline approximations E_m,n(f)p with undetermined n nodes in the metric of the space L_p(0, 1) (1p) is studied in a class of functionsf(x) for which f ^m+1 (x)L_q(0, 1)1(1qt8) or var {f(m) (x); 0, 1}1 (m=1, 2, ..., the preceding derivative is assumed absolutely continuous). An exact order of decrease of the mentioned bounds is found as n , and asymptotic formulas are obtained for p= and 1q in the case of an approximation by broken lines (m=1). The simultaneous approximation of the function and its derivatives by spline functions and their appropriate derivatives is also studied.Translated from Matematicheskie Zametki, Vol. 7, No. 1, pp. 31–42, January, 1970.     

Spectral properties of Neumann Laplacian of horns

We study the Neumann Laplacian of unbounded regions in ⁿ with cusps at infinity so that the corresponding Dirichlet Laplacian has compact resolvent. Typical of our results is that of the region {(x, y)²x, y|<1} the Neumann Laplacian has absolutely continuous spectrum [0, ) of uniform multiplicity four and an infinity of eigenvaluesE _o<E ₁... and that for the region {(x, y)²y|1}, it has absolutely continuous spectrum [1/4, ) of uniform multiplicity 2 and an infinity of eigenvaluesE ₀=0<E ₁.... We use the Enss theory with a suitable asymptotic dynamics.The second author's research is partially funded under NSF grand number DMS-8801918     

Approximation of differentiable functions by polynomial splines in domains with external peaks

For unbounded domains with external power-type peaks, we propose a method for the approximation of functionsf(x) w _p ^r () by polynomial splines in the metricw _p ^r (), 1pq, and present the corresponding estimates.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 9, pp. 1224–1233, September, 1994.     

Balanced sets andQ-polynomial association schemes

The notion of a balanced set of vectors is defined, and the classification of such sets suggested. A slightly stronger condition is considered for association schemes, with the following result. LetX be ad-class symmetric association scheme with Bose-Mesner algebraM and Krein parametersq _ij ^h , and let E = E_t (0 t d) be any primitive idempotent ofM. For eachx X letx _E denote the diagonal matrix withy, y entryE _xy(y X). Define the representation diagramD _E on the nodes 0, 1, ...,d by drawing an undirected arc between any nodesh, j for whichq _tj ^h > 0. CallD _E an augmented tree if it has a single loop, whose removal yields a tree. Writexy = i ifx, y X are ith associates (0 i d).     

The structure of an infinite,complete, convex hypersurface inE 4 with bounded mean curvature

The following theorem is proved. THEOREM. If on an infinite, complete, convex hypersurface F in E⁴ the mean curvature is 1 – H 1, where 0 10^–11, then F is a cylindrical hypersurface.Translated from Ukrainskii Geometricheskii Sbornik, No. 34, pp. 8–9, 1991.     

On elementary equivalence and isomorphism of clone segments

The principal application of a general theorem proved here shows that for any choice 1mnp of integers there exist metric spacesX andY such that the initialk-segments of their clones of continuous maps coincide exactly whenkm, are isomorphic exactly whenkn, and are elementarily equivalent exactly whenkp.Dedicated to Prof. László Fuchs on the occasion of his 70th birthday     

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.     

Subsets with Restricted Movement

Let G be a finite permutation group on a set with no fixed points in and let m and k be integers with 0 < m < k. For a finite subset of the movement of is defined as move() = max_gG| ^g \ |. Suppose further that G is not a 2-group and that p is the least odd prime dividing |G| and move() m for all k-element subsets of . Then either || k + m or k (7m – 5) / 2, || (9m – 3)/2. Moreover when || > k + m, then move() m for every subset of .     

Über die Häufigkeit großer Differenzen konsekutiver Primzahlen

The following theorem is going to be proved. Letp _m be them-th prime and putd _m :=p _m+1–p _m . LetN(,T), 1/21,T3. denote the number of zeros =+i of the Riemann zeta function which fulfill and ||T. Letc2 andh0 be constants such thatN(,T)T ^c(1–) (logT) ^h holds true uniformly in 1/21. Let >0 be given. Then there is some constantK>0 such that      

A series of search designs for 2m factorial designs of resolution V which permit search of one or two unknown extra three-factor interactions

In the absence of four-factor and higher order interactions, we present a series of search designs for 2^m factorials (m6) which allow the search of at most k (=1,2) nonnegligible three-factor interactions, and the estimation of them along with the general mean, main effects and two-factor interactions. These designs are derived from balanced arrays of strength 6. In particular, the nonisomorphic weighted graphs with 4 vertices in which two distinct vertices are assigned with integer weight (13), are useful in obtaining search designs for k=2. Furthermore, it is shown that a search design obtained for each m6 is of the minimum number of treatments among balanced arrays of strenth 6. By modifying the results for m6, we also present a search design for m=5 and k=2.     

Fast Preconditioned Iterative Methods for Convolution-Type Integral Equations

We consider solving the Fredholm integral equation of the second kind with the piecewise smooth displacement kernel x(t) + _j=1 ^m µ_j x(t – t _j) + ₀ k(t – s)x(s) ds = g(t), 0 t , where t _j (–, ), for 1 j m. The direct application of the quadrature rule to the above integral equation leads to a non-Toeplitz and an underdetermined matrix system. The aim of this paper is to propose a numerical scheme to approximate the integral equation such that the discretization matrix system is the sum of a Toeplitz matrix and a matrix of rank two. We apply the preconditioned conjugate gradient method with Toeplitz-like matrices as preconditioners to solve the resulting discretization system. Numerical examples are given to illustrate the fast convergence of the PCG method and the accuracy of the computed solutions.     

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.     

Some Y-Groups

We call a Y-group a quotient of a Coxeter group with a Y _pqr -diagram in accordance with the ATLAS terminology. Here we prove, without computer aid, that some 3-transposition groups are also Y-groups. For each of these groups, the arms of the Coxeter diagram Y _pqr are such that (1 = r q p 5) or (2 = r q 3, q p 5) holds, the additional relations generally describe the center or the Schur multiplier.     

Paradoxical subsets of hyperbolic and spherical discs

Given a disc D of radius r in H ² (resp. S ²) with <r (resp. <r), we determine the pairs (m,n) for which there is an (m,n)-paradoxical subset of D but not an (m–1, n)-paradoxical subset of D or an (m, n–1)-paradoxical subset of D.     

Weak Sequential Completeness of β-duals of Double Sequence Spaces

We consider dual pairs E,E ⁽⁾ of double sequence spaces E and E ⁽⁾, where E ⁽⁾ is the -dual space of E with respect to the -convergence of double sequences for = p (Pringsheim convergence), bp (bounded p-convergence) and r (regular convergence). Motivated by Boos, Fleming and Leiger [3], we introduce two oscillating properties (signed P_OSCP(k), k {1,2}) for a double sequence space E such that the signed P_OSCP(1) guarantees the (E ^(p), E)-sequential completeness of E ^(p), whereas the signed P_OSCP(2) implies the equalities E ^(r) = E ^(bp) = E ^(p) and the (E ⁽⁾, E)-sequentialcompleteness of E ⁽⁾ for = bp and r.     

On monotone and convex approximation by algebraic polynomials

The following results are obtained: If >0, 2, [3, 4], andf is a nondecreasing (convex) function on [–1, 1] such thatE _n (f) n ^– for any n>, then E _n ⁽¹⁾ (f)Cn ^– (E _n ⁽²⁾ (f)Cn ^–) for n>, where C=C(), E_n(f) is the best uniform approximation of a continuous function by polynomials of degree (n–1), and E _n ⁽¹⁾ (f) (E _n ⁽²⁾ (f)) are the best monotone and convex approximations, respectively. For =2 ( [3, 4]), this result is not true.Published in Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 9, pp. 1266–1270, September, 1994.