A test of convergence of Fourier series with respect to multiplicative systems,analogous to the Jordan test

, {p _n} _n=0 (p₀=1, _n2 n2). : x f(t) V(G)

Blocks of orthogonal random variables and the strong law of large numbers

(X _k ),k=1,2,... — _k ² >1; (X _k ) , E(X _k X _t )=0 p k<>(p+1) (p,k,l=1, 2, ...) , , ,

Spectral synthesis for Euler type operators

A=(a _ij) _i ^j=1 — k-o ,a _ij . :

Fourier series of functions whose Hankel transform is supported on [0, 1]

LetJ denote the Bessel function of order . For >–1, the system x^–/2–1/2J_+2n+1(x^1/2, n=0, 1, 2,..., is orthogonal onL ²((0, ),x dx). In this paper we study the mean convergence of Fourier series with respect to this system for functions whose Hankel transform is supported on [0, 1].Communicated by Mourad Ismail.     

Asymptotics of polynomials orthogonal with respect to varying measures

Letd be a finite positive Borel measure on the interval [0, 2] such that >0 almost everywhere; andW _n be a sequence of polynomials, degW _n =n, whose zeros (w _n ,1,,w _n,n lie in [|z|1]. Let d _n <> for each_nN, whered _n =d/|W _n (e ⁱ )|². We consider the table of polynomials _n,m such that for each fixednN the system _n,m,mN, is orthonormal with respect tod _n . If

Norm behavior and zero distribution for orthogonal polynomials with nonsymmetric weights

The asymptotic behavior of thenth root of the leading coefficient of orthogonal polynomials on (–,) and the distribution of their zeros is studied for nonsymmetric weights that behave like exp(–2B|x|) whenx>0 and exp(–2Ax ) whenx<0,>AB. These results generalize previous investigations of Rakhmanov and Mhaskar and Saff who handle the symmetric caseA=B.Communicated by Paul Nevai.     

The GHS inequality and the Riemann hypothesis

LetV(t) be the even function on (–, ) which is related to the Riemann xi-function by (x/2)=4 _– exp(ixt–V(t))dt. In a proof of certain moment inequalities which are necessary for the validity of the Riemann Hypothesis, it was previously shown thatV'(t)/t is increasing on (0, ). We prove a stronger property which is related to the GHS inequality of statistical mechanics, namely thatV' is convex on [0, ). The possible relevance of the convexity ofV' to the Riemann Hypothesis is discussed.Communicated by Richard Varga.     

Solution of two sequencing problems

The solution of the following problems is offered. Suppose a multiset J (¦J¦=p) is given. For each pair of elements and J, a number 1 P is given. Moreover, if 1 < x<p then x is undefined. If x=1, then x=p. Problem 1. Find the permutation ₁..._F of elements of the multiset J satisfying the following conditions. Let _i, _i=. If i,j < x, thenj <i. If i,j > x, then i<j. Such a permutation is called a PC-schedule. Problem 2. Find a PC-schedule in which the following property holds: if i < x < j, _i=, _j=, then. Such a PC-schedule is called an SC-schedule. The conditions under which these problems have solutions are studied. For their solution an algorithm of shifts is used with the complexity O(¦B(J)¦²¦J¦).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 124, pp. 44–72, 1983.     

Intuitionistic weak arithmetic

We construct -framed Kripke models of i₁ and i₁ non of whose worlds satisfies xy(x=2yx=2y+1) and x,yzExp(x, y, z) respectively. This will enable us to show that i₁ does not prove ¬¬xy(x=2yx=2y+1) and i₁ does not prove ¬¬x, yzExp(x, y, z). Therefore, i₁¬¬lop and i₁¬¬i₁. We also prove that HAl₁ and present some remarks about i₂. Mathematics Subject Classification (2000):03F30, 03F55, 03H15.     

Subadditive functions on modules and subgroups of abelian groups

Thepositive half A ₊ of an ordered abelian groupA is the set {x Ax 0} andM A ₊ is amodule if for allx, y M alsox + y, |x – y| M. If A ₊ \M thenM() is the module generated byM and. S M isunbounded inM if(x M)(y S)(x y) and isdense inM if (x₁, x₂ M)(y S) (x₁ <>₂ x₁ y x₂). IfM is a module, or a subgroup of any abelian group, a real-valuedg: M R issubadditive ifg(x + y) g(x) + g(y) for allx, y M. The following hold:

On vector-valued random Fourier series

Consider a (complex) Banach spaceX, such thatX C_O, and vectors(X _i ) _i ofX. Consider an independent standard normal sequence(g _i ) _i . Then if anX-valued random Fourier series _{|k| n} e ^ikt g _k x _k satisfies

On the computation of modules of long quadrilaterals

We study quadrilateralsQ which are given by two intervals on {:Im = 0} and {:Im = 1}, and two Jordan arcs ₁, ₂, in {:0 Im 1} connecting these two intervals. Many practical problems require the determination of the modulem(Q) ofQ, but ifQ is long, i.e., if

The Dimension Function of Holomorphic Spaces of a Real Submanifold of an Almost Complex Manifold

Let M be a real submanifold of an almost complex manifold and let be the maximal holomorphic subspace, for each x M. We prove that c:M,c(x)=dim H _x is upper-semicontinuous.     

On the asymptotic behaviour of first passage times for transient random walk

Summary Let _x denote the time at which a random walk with finite positive mean first passes into (x, ), wherex0. This paper establishes the asymptotic behaviour of Pr { _x >n} asn for fixedx in two cases. In the first case the left hand tail of the step-distribution is regularly varying, and in the second the step-distribution satisfies a one-sided Cramér type condition. As a corollary, it follows that in the first case Pr { _x >n}/Pr{ ₀ >n} coincides with the limit of the same quantity for recurrent random walk satisfying Spitzer's condition, but in the second case the limit is more complicated.     

Fast decreasing polynomials

Matching two-sided estimates are given for the minimal degree of polynomialsP satisfyingP(0)=1 and ¦P(x)|exp(– (¦x¦)),x [–1,1], where is an arbitrary, in [0, 1], increasing function. Besides these fast decreasing polynomials we also consider bell-shaped polynomials and polynomials approximating well the signum function.Communicated by Edward B. Saff.     

Some nodes matrices appearing in the numerical analysis for singular integral equations

Let {p _m (w)} be the sequence of Jacobi polynomials corresponding to the weightw(x)=(1–x)(1+x), 0, <1. denote=">x _k (w)=cos _m,k (w),k=1,...,m, the zeros ofp _m (w). If +=0, then the estimates

On the uniqueness of canonical points in the Hobby-Rice theorem

According to the Hobby-Rice theorem for anyn-dimensional subspaceU _n ofL ₁([a, b], ) ( positive, finite, nonatomic) there exist points =s ₀x ₁x _m+1=b, where 0mn, such that

Epsilon efficiency

This paper considers the extension of -optimality for scalar problems to vector maximization problems, or efficiency problems, which havem objective functions defined on a set .It is shown that the natural extension of the scalar -optimality concepts [viz, given >0, given a solution setS, ifxS there exists an efficient solutiony with f(x)–f(y), and given an efficient solutiony, there exists anxS with f(x)–f(y)] do not hold for some methods used. Six concepts of -efficient sets are introduced and examined, to a very limited extent, in the context of five methods used for generating efficient points or near efficient points.In doing so, a distinction is drawn between methods in which the surrogate optimizations are carried out exactly, and those where terminal -optimal solutions are obtained.The author would like to thank the referees whose thoroughness was extremely helpful for the revised paper.     

Comparative cooperative game theory

Given two side-payment gamesv andw, both defined for the same finite player-setN, the following three welfare criteria are characterized in terms of the datav andw: (A) For everyy C(w) there existsx C(v) such thatyx; (A) For everyxC(v) there existsyC(w) such thatyx; and (B) There existyC(w) andxC(v) such thatyx. (HereC(v) denotes the core ofv.) Given two non-side-payment gamesv andw, sufficient conditions for the criteria (A) and (B) are established, by observing that an ordinal convex game has a large core.In memory of my teacher in Japan, Professor Ryuichi Watanabe, 1928–1986.