Some New Results for McKean’s Graphs with Applications to Kac’s Equation

The main goal of the present paper is to sharpen some results about the error made when the Wild sums, used to represent the solution of the Kac analog of Boltzmann’s equation, are truncated at the n-th stage. More precisely, in Carlen, Carvalho and Gabetta (J. Funct. Anal. 220: 362–387 (2005)), one finds a bound for the above-mentioned error which depends on (an ^Λ+ε). On the one hand, it is shown that Λ, the least negative eigenvalue of the linearized collision operator, is the best possible exponent. On the other hand, ε is an extra strictly positive number and a a positive coefficient which depends on ε too. Thus, it is interesting to check whether ε can be removed from the above bound. According to the aforesaid reference, this problem is studied here by means of the probability distribution of the depth of a leaf in a McKean random tree. In fact, an accurate study of the probability generating function of such a depth leads to conclude that the above bound can be replaced with (a′ n ^Λ).     

The Distribution of Reciprocal Pairs Modulo Polynomials over a Finite Field

Given a finite field F_q of order q, a fixed polynomial g in –F_q[X] of positive degree, and two elements u and v in the ring of polynomials in R = F_q [X]/gF_q[X], the question arises: How many pairs (a, 6) are there in R × R so that ab ? 1 mod g and so that a is close to u while b is close to v ? The answer is, about as many as one would expect. That is, there are no favored regions in R × R where inverse pairs cluster. The error term is quite sharp in most cases, being comparable to what would happen with random distribution of pairs. The proof uses Kloosterman sums and counting arguments. The exceptional cases involve fields of characteristic 2 and composite values of g. Even then the error term obtained is nontrivial. There is no computational evidence that inverses are in fact less evenly distributed in this case, however.     

对称矩阵部分特征值之和的非光滑分析

本文研究n阶实对称矩阵A的前m项最大特征值之和fm（A）的非光滑分析问题．利用Ky－Fan的关于特征值之和的变分原理以及凸分析理论，得到了fm（A）的次梯度和方向导数的显式表达式．     

Storage capacity of a dam with gamma type inputs

Summary Consider mutually independent inputsX ₁,...,X _n onn different occasions into a dam or storage facility. The total input isY=X ₁+...+X _n. This sum is a basic quantity in many types of stochastic process problems. The distribution ofY and other aspects connected withY are studied by different authors when the inputs are independently and identically distributed exponential or gamma random variables. In this article explicit exact expressions for the density ofY are given whenX ₁,...,X _n are independent gamma distributed variables with different parameters. The exact density is written as a finite sum, in terms of zonal polynomials and in terms of confluent hypergeometric functions. Approximations whenn is large and asymptotic results are also given.     

A note on the Le Verrier-Fadeev's method

We give an alternative formulation of Le Verrier-Fadeev's method in terms of the Weierstrass root-finding method. Some computational aspects are discussed.This paper is partially supported by the Bulgarian Ministry of Science and Education, Contract MM-515/95.     

两两NQD列的广义Jamison型加权和强收敛性注记

通过随机变量序列广义Jamison型加权和的系数指标函数自身性质,讨论两两NQD(Negatively Quadrant Dependent)列的广义Jamison型加权和的强收敛性,将NA中一些相应结果推广到两两NQD列场合,削弱了以前结果的条件.最后给出的例子进一步说明结论更具一般性.     

Image space analysis of generalized fractional programs

The solution of a particular nonconvex program is usually very dependent on the structure of the problem. In this paper we identify classes of nonconvex problems involving either sums or products of ratios of linear terms which may be treated by analysis in a transformed space. In each class, the image space is defined by a mapping which associates a new variable with each original ratio of linear terms. In the image space, optimization is easy in certain directions, and the overall solution may be realized by sequentially optimizing in these directions.In addition to these ratio problems, we also show how to use image space analysis to treat the subclass of problems whose objective is to optimize a product of linear terms. For each class of nonconvex problems, we present an algorithm that locates global solutions by computing both upper and lower bounds on the solution and then solving a sequence of linear programming sub-problems. We also demonstrate the algorithms described in this paper by solving several example problems.     

On the limiting behavior of randomly weighted partial sums

We study the almost sure limiting behavior and convergence in probability of weighted partial sums of the form where {W_nj, 1jn, n1} and {X_nj, 1jn, n1} are triangular arrays of random variables. The results obtain irrespective of the joint distributions of the random variables within each array. Applications concerning the Efron bootstrap and queueing theory are discussed.     

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 the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves

We show that the elliptic curve analogue of the linear congruential generator produces sequences with high linear complexity and good multidimensional distribution.communicated by: A. MenezesAMS Classification: 11T23, 14H52, 65C10