Limit Theorems for the Maximum Terms of a Sequence of Random Variables with Marginal Geometric Distributions

Let X _n1 ^* , ... X _nn ^* be a sequence of n independent random variables which have a geometric distribution with the parameter p _n = 1/n, and M _n ^* = \max\{X _n1 ^* , ... X _nn ^* }. Let Z ₁, Z₂, Z₃, ... be a sequence of independent random variables with the uniform distribution over the set N _n = {1, 2, ... n}. For each j N _n let us denote X _nj = min{k : Z_k = j}, M _n = max{X_n1, ... X_nn}, and let S _n be the 2nd largest among X _n1, X_n2, ... X_nn. Using the methodology of verifying D(u_n) and D'(u_n) mixing conditions we prove herein that the maximum M _n has the same type I limiting distribution as the maximum M _n ^* and estimate the rate of convergence. The limiting bivariate distribution of (S_n, M_n) is also obtained. Let _n, _n N_n, , and T _n = min{M(A_n), M(B_n)}. We determine herein the limiting distribution of random variable T _n in the case _n , _n/_n > 0, as n .     

Sharp Large Deviation Estimates for the Stochastic Heat Equation

We consider the family {X , 0} of solution to the heat equation on [0,T]×[0,1] perturbed by a small space-time white noise, that is _t X = X +b({X })+({X }) . Then, for a large class of Borelian subsets of the continuous functions on [0,T]×[0,1], we get an asymptotic expansion of P({X }A) as 0. This kind of expansion has been handled for several stochastic systems, ranging from Wiener integrals to diffusion processes.     

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.     

A strong law for weighted sums of i.i.d. random variables

A strong law is proved for weighted sumsS _n=a _in X _i whereX _i are i.i.d. and {a _in} is an array of constants. When sup(n ^–1|a _in | ^q )^1/q <, 1<q andX _i are mean zero, we showE|X| ^p <,p ^l+q ^–1=1 impliesS _n /n 0. Whenq= this reduces to a result of Choi and Sung who showed that when the {a _in} are uniformly bounded,EX=0 andE|X|< impliesS _n /n 0. The result is also true whenq=1 under the additional assumption that lim sup |a _in |n ^–1 logn=0. Extensions to more general normalizing sequences are also given. In particular we show that when the {a _in} are uniformly bounded,E|X|^1/< impliesS _n /n 0 for >1, but this is not true in general for 1/2<<1, even when theX _i are symmetric. In that case the additional assumption that (x ^1/ log^1/–1 x)P(|X|x)0 asx provides necessary and sufficient conditions for this to hold for all (fixed) uniformly bounded arrays {a _in}.     

Efficiency of Proximal Bundle Methods

We give efficiency estimates for proximal bundle methods for finding f_*min_Xf, where f and X are convex. We show that, for any accuracy <0, these methods find a point x^kX such that f(x^k)–f^* after at most k=O(1/³) objective and subgradient evaluations.     

Topological algebras of kernels

Given a locally convex spaceE we define thelocally convex algebra of kernels , in such a way that the set of all its proper closed 2-sided ideals coincides with the set of all closed vector subspaces of ker(h), whereh is a continuous algebra morphism of into _b (E). Moreover,h is a strictly irreducible representation such that every representation: ; _b (F) (F a locally convex space) is of the form =oh, where stands for a continuous isomorphis ofIm(h) into _b (F), for a suitable topology onIm(h).     

Central orderings in fields of real meromorphic function germs

Let X_oR ⁿ be an irreducible analytic germ and the order space of its field of meromorphicfunetion germs. A formal half-branch in X_o is a kind of C-map germ c[0,)X_o; an ordering is centered at c if it contains the functions which are positive on c. We obtain a partition ¹,...,^d, d=dim X_o, of the set ^* of central (i.e.: centered at some half-branch) orderings, according to the dimension of half-branches. Then we show that all ^e, e= 1,.,d, as well as the set \^* of noncentral orderings, are dense in . Finally, we solve the 17th Hubert Problem for analytic germs.     

Cross-monotone subsequences

Two finite real sequences (a ₁,...,a _k ) and (b ₁,...,b _k ) are cross-monotone if each is nondecreasing anda _i+1–a _i b _i+1–b _i for alli. A sequence (₁,..., _n ) of nondecreasing reals is in class CM(k) if it has disjointk-term subsequences that are cross-monotone. The paper shows thatf(k), the smallestn such that every nondecreasing (₁,..., _n ) is in CM(k), is bounded between aboutk ²/4 andk ₂/2. It also shows thatg(k), the smallestn for which all (₁,..., _n ) are in CM(k)and eithera _k b ₁ orb _k a ₁, equalsk(k–1)+2, and thath(k), the smallestn for which all (₁,..., _n ) are in CM(_k)and eithera ₁b ₁...a _k b _k orb ₁a ₁...b _k a _k , equals 2(k–1)²+2.The results forf andg rely on new theorems for regular patterns in (0, 1)-matrices that are of interest in their own right. An example is: Every upper-triangulark ²×k ² (0, 1)-matrix has eitherk 1's in consecutive columns, each below its predecessor, ork 0's in consecutive rows, each to the right of its predecessor, and the same conclusion is false whenk ² is replaced byk ²–1.     

An embedding theorem for a limiting exponent

We consider the function space B _p ^l () of functionsf(x), defined on the domain of a certain class and characterized by specific differential-difference properties in L_p(). We prove a theorem on the embedding B _p,q ^l () L_q in the case whenl=n/p –n/q >0 and its generalization for vectorl, p, q.Translated from Matematicheski Zametki, Vol. 6, No. 2, pp. 129–138, August, 1969.     

A note on sub-multiplicative norms

Summary IfX is a finite-dimensional linear space andL(X) the linear space of linear operators onX thenL(X) may be represented asXX ^*. IfE={e ₁, ...,e _n } is a basis forX and e _j y _j ^* is a typical element ofXX ^*, then norms can be introduced onL(X) in the form y _j ^* e _j . Given that the norm onX isE-absolute we derive a necessary and sufficient condition for the norm onL(X) to be submultiplicative.     

Application of Topological Degree to the Study of Bifurcation in von Kármán Equations

The aim of this paper is to illustrate the use of topological degree for the study of bifurcation in von Kármán equations with two real positive parameters and for a thin elastic disk lying on the elastic base under the action of a compressing force, which may be written in the form of an operator equation F(x, , ) = 0 in some real Banach spaces X and Y. The bifurcation problem that we study is a mathematical model for a certain physical phenomenon and it is very important in the mechanics of elastic constructions. We reduce the bifurcation problem in the solution set of equation F(x, , ) = 0 at a point (0, ₀, ₀) X × IR ₊ ² to the bifurcation problem in the solution set of a certain equation in IR ⁿ at a point (0, ₀, ₀) IR ⁿ × IR ₊ ², where n = dim Ker F _x (0, ₀, ₀) and F _x (0, ₀, ₀): X Y is a Fréchet derivative of F with respect to x at (0, ₀, ₀). To solve the bifurcation problem obtained as a result of reduction, we apply homotopy and degree theory.     

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.     

Propriété de stabilité de la fonction extrémale relative

Nous donnons une caractérisation des domaines DX pour lesquels la fonction extrémale relative ^*(,E,D) a la propriété de stabilité pour tout ED, i.e. lim _k^*(,E,D _k )=^*(,E,D), ED. Ensuite, nous étudions la relation entre cette propriété et les enveloppes pluripolaires. Nous concluons par quelques remarques sur la propriété de stabilité lim _k^*(,E _k ,D)=^*(,E,D).     

The existence of some resolvable block designs with divisibility into groups

This paper proves the existence of resolvable block designs with divisibility into groups GD(v; k, m; ₁, ₂) without repeated blocks and with arbitrary parameters such that ₁ = k, (v–1)/(k–1) ₂ v^k–2 (and also ₁ k/2, (v–1)/(2(k–1)) ₂ v^k–2 in case k is even) k 4 andp=1 (mod k–1), k < p for each prime divisor p of number v. As a corollary, the existence of a resolvable BIB-design (v, k, ) without repeated blocks is deduced with X = k (and also with = k/2 in case of even k) k , where a is a natural number if k is a prime power and=1 if k is a composite number.Translated from Matematicheskie Zametki, Vol. 19, No. 4, pp. 623–634, April, 1976.     

Convergence of the steepest descent method for minimizing quasiconvex functions

To minimize a continuously differentiable quasiconvex functionf: ⁿ , Armijo's steepest descent method generates a sequencex ^k+1 =x ^k –t _k f(x ^k ), wheret _k >0. We establish strong convergence properties of this classic method: either , s.t. ; or arg minf = , x ^k andf(x ^k ) inff. We also discuss extensions to other line searches.The research of the first author was supported by the Polish Academy of Sciences. The second author acknowledges the support of the Department of Industrial Engineering, Hong Kong University of Science and Technology.We wish to thank two anonymous referees for their valuable comments. In particular, one referee has suggested the use of quasiconvexity instead of convexity off.     

On a new class of multiplicative pseudo-random number generators

In the computing literature, there are few detailed analytical studies of the global statistical characteristics of a class of multiplicative pseudo-random number generators.We comment briefly on normal numbers and study analytically the approximately uniform discrete distribution or (j,)-normality in the sense of Besicovitch for complete periods of fractional parts {x _{0 1} ⁱ /p} on [0, 1] fori=0, 1,..., (p–1)p^–1–1, i.e. in current terminology, generators given byx _{n+1 1} x _n mod p wheren=0, 1,..., (p–1)p ^–1–1,p is any odd prime, (x ₀,p)=1, ₁ is a primitive root modp ², and 1 is any positive integer.We derive the expectationsE(X, ),E(X ², ),E(X _nX_n+k); the varianceV(X, ), and the serial correlation coefficient k. By means of Dedekind sums and some results of H. Rademacher, we investigate the asymptotic properties of k for various lagsk and integers 1 and give numerical illustrations. For the frequently used case =1, we find comparable results to estimates of Coveyou and Jansson as well as a mathematical demonstration of a so-called rule of thumb related to the choice of ₁ for small k.Due to the number of parameters in this class of generators, it may be possible to obtain increased control over the statistical behavior of these pseudo-random sequences both analytically as well as computationally.     

On generalized gamma functions related to the Laurent coefficients of the Riemann zeta function

Summary We study a class of generalized gamma functions _k (z) which relate to the generalized Euler constants _k (basically the Laurent coefficients of(s)) as (z) does to the Euler constant. A new series expansion for _k is derived, and the constant term in the asymptotic expansion for log _k (z) is studied in detail. These and related constants are numerically computed for 1 k 15.     

∑II∑ threshold formulas

A II formula has the form, where eachL is either a variable or a negated variable. In this paper we study the computation of threshold functions by II formulas. By combining the proof of the Fredman-Komlós bound [5, 10] and a counting argument, we show that fork andn large andkn/2, every II formula computing the threshold functionT _k ⁿ has size at least exp . Fork andn large andkn ^2/3, we show that there exist II formulas for computingT _k ⁿ with size at most exp .     

Fehlerabschätzungen für Gauß-Quadraturformeln

Summary We consider Gauss quadrature formulaeQ _n ,n, approximating the integral ,w an even weight function. Let be analytic inK _r :={z:|z|<r},r>1, and . The error functionalR _n :=I-Q _n is continuous with respect to |·|_r and the relation , q_2k (x):=x ^2k holds.In this paper estimates for R _n are given. To this end we first derive two new representations of R _n which are essential for our further investigations. The R _n =r ² R _n (), with (x):=1/(r ²-x ²), is estimated in various ways by using the best uniform approximation of in P_2n-1, and also the expansion of with respect to Chebyshe polynomials of the first and second kind. Forw(x)=(1-x ²), =±1/2, R _n is calculated. The asymptotic behaviour, forr1+, of R _n and of the derived error bounds is also discussed. Finally, we compare different error bounds and give numerical examples.