A Note on a Boundary Value Problem

In this note, we prove that, for Robins boundary value problem, a unique solution exists if f_x(t, x, x), f_x(t, x, x), (t), and (t) are continuous, and f_x -(t), f_x -(t), 4(t) ² + ²(t) ++ 2(t), and 4(t) ² + ²(t) + 2(t).AMS Subject Classification (2000) 34B15     

On the Uniform Summability of Multiple Walsh-Fourier Series

In this paper we prove that if f C (0, 1 ^N ) and the function f is of bounded partial variation, then the N-dimensional Walsh-Fourier series of the function f is uniformly (C,–) summable (₁ +...+ _N < 1, _i > 0, i = 1,...,N) in the sense of Pringsheim. If ₁ +...+ _N = 1, _i > 0, i = 1,2,...,N, then there exists a continuous function f ₀ of bounded partial variation on [0, 1] ^N such that the Cesàro (C,–) means _m ^– (f₀,Õ) of the N-dimensional Walsh-Fourier series of f ₀ diverge over cubes.     

Nonparametric Estimation of a Conditional Quantile for α-Mixing Processes

Let (X_i,Y _i) be a set of observations form a stationary -mixing process and (x) be the conditional -th quantile of Y given X = x. Several authors considered nonparametric estimation of (x) in the i.i.d. setting. Assuming the smoothness of FF(x), we estimate it by local polynomial fitting and prove the asymptotic normality and the uniform convergence.     

The evolution of a population for a certain viability system

Summary For the Fisher-Wright-Haldane selection model with fitness parametersf _ij =1+ _{i ij} ( _i –1) a complete global analysis is performed.

---

Zusammenfassung Für das Fisher-Wright-Haldane-Selektionsmodell mit den Fitneßparameternf _ij =1+ _{i ij} ( _i –1) wird eine vollständige globale Analyse, durchgeführt.

     

The Product of Independent Random Variables with Regularly Varying Tails

A distribution is said to have regularly varying tail with index – (0) if lim _x(kx,)/(x,)=k ^– for each k>0. Let X and Y be independent positive random variables with distributions and , respecitvely. The distribution of product XY is called Mellin–Stieltjes convolution (MS convolution) of and . It is known that D() (the class of distributions on (0,) that have regularly varying tails with index –) is closed under MS convolution. This paper deals with decomposition problem of distributions in D() related to MS convolution. A representation of a regularly varying function F of the following form is investigated: F(x)= _k=0 ^n–1 b _k f(a ^k x), where f is a measurable function and a and b _k (k=1,...,n–1) are real constants. A criterion is given for these constants in order that f be regularly varying. This criterion is applicable to show that there exist two distributions and such that neither nor belongs to D() (>0) and their MS convolution belongs to D().     

Maximum of the fourth diameter in the family of continua with prescribed capacity

We obtain a complete solution of the problem of the maximum of the fourth diameter in the family of continua with capacity 1. Let E(o, eⁱ, e^–i). 0<i, e^–i; H(=cap E(o, eⁱ, e^–i). Let C() be the common point of three analytic arcs which form E(o, eⁱ, e^–i). One shows that the indicated maximum is realized by the continuum ={z:H(₀)z ²E(o, eⁱ, e^–i)} where ₀, o<₀z eⁱ z+C ( is a real and C is a complex constant). One finds the value of the required maximum. The paper contains a brief exposition of the proof of this result.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 59, pp. 60–79, 1976.     

Quadratic spline interpolation on uniform meshes

The interpolation problem at uniform mesh points of a quadratic splines(x _i)=f _i,i=0, 1,...,N ands(x ₀)=f₀ is considered. It is known that s–f=O(h ³) and s–f=O(h ²), whereh is the step size, and that these orders cannot be improved. Contrary to recently published results we prove that superconvergence cannot occur for any particular point independent off other than mesh points wheres=f by assumption. Best error bounds for some compound formulae approximatingf _i andf _i ⁽³⁾ are also derived.     

Invariant equations defining coincident root loci

Let F(x) = xⁿ+₁ x^n-1+₂ x^n-2+ ··· +_n be a polynomial with complex coefficients, and suppose we are given a partition (₁,...,_r) of n. It is a classical problem to determine explicit algebraic conditions on the _i so that F may have roots with multiplicities ₁,...,_r. We give an invariant theoretic solution to this problem, to wit, we exhibit a set of covariants of F whose vanishing is a necessary and sufficient condition. The construction of such covariants is combinatorial, and involves associating a set of graphs on n vertices (called decisive graphs) to each .Received: 28 September 2003     

Superstable implicit Runge-Kutta methods for second order initial value problems

Using the well known properties of thes-stage implicit Runge-Kutta methods for first order differential equations, single step methods of arbitrary order can be obtained for the direct integration of the general second order initial value problemsy=f(x, y, y),y(x _o)=y _o,y(x _o)=y _o. These methods when applied to the test equationy+2y+ ² y=0, ,0, +>0, are superstable with the exception of a finite number of isolated values ofh. These methods can be successfully used for solving singular perturbation problems for which f/y and/or f/y are negative and large. Numerical results demonstrate the efficiency of these methods.     

Efficiency and the uniform linear minorization of convex functions

LetX be a Banach space, and let {f _i:iI} be a family of proper lower semicontinuous convex functions defined onX, each of whose epigraphs meets a fixed bound subset ofX×. We say that {f _i:iI} is uniformly linearly minorized if there exists a positive scalar such that for alliI andxX, we havef _i(x)–(1+x). We present two very different characterizations of uniform linear minorization for such a family. Using one of these, we show that either strong or weak epi-convergence of a sequence of convex functions at some point in the effective domain of the limit implies, uniform linear minorization for the entire sequence.With 1 Figure     

On the boundedness of Weyl sums

Leta be irrational and letf:[0,1] be Riemann-integrable with integral zero. Letf _n (x) denote the Weyl sumf _n (x):= _k=0 ^n–1 f({x k>}),x/[0,1[,n. We prove criteria for the boundedness of the sequence (f _n ) _n1 and discuss the relation of this question to irregularities of the distribution of sequences.     

Growth of length of sequential derivation transformed into natural one

We consider the (&, )-fragment of the intuitionistic propositional calculus. It is proved that under the standard transformation of a Gentzen derivation into a natural derivation(), the length of (())2^2·length( ). There is constructed a sequence of Gentzen derivations of length _i, for which the length of (( _i))2^{1/3·length(i}), which shows that the upper bound obtained is not too weak.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 192–196, 1979.     

Numerical application of Euler's series transformation and its generalizations

Summary A nonlinear generalizationÊ _z of Euler's series transformation is compared with the (linear) Euler-Knopp transformationE _z and a twoparametric methodE . It is shown how to applyE orE _, to compute the valuef(z_o) of a functionf from the power series at 0 iff is holomorphic in a half plane or in the cut plane. BothE andE _, are superior toÊ _z . A compact recursive algorithm is given for computingE andE _,.     

The generalized order complementarity problem

Given an ordered Banach Space (E,K) andm functionsf ₁,f ₂,...,f _m:EE, the generalized order complementarity problem associated with {f _i} andK is to findx ₀K such thatf _i(x ₀)K,i=1,...,m, and (x ₀,f ₁(x ₀),...,f _m(x ₀))=0. The problem is shown to be equivalent to several fixed-point problems and equivalent to the order complementarity problem studied by Borwein and Dempster and by Isac. Existence and uniqueness of solutions and least-element theory are shown in the spacesC(, ) andL _p(, ). For general locally convex spaces, least-element theory is derived, existence is proved, and an algorithm for computing a solution is presented. Applications to the mixed lubrication theory of fluid mechanics are described.     

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.     

Non polynomial splines and weakly singular two-point boundary value problems

In the present paper we shall consider an application of simple non-polynomial splines to a numerical solution of a weakly singular two-point boundary value problem:x ^– (x y)=f(x,y), (0<x1) subject toy(0)=0,y(1)=c ₁(1) ory(0)=c ₂,y(1)=c ₃(0<<1). Our collocation method gives a continuously differentiable approximation and isO(h ²)-convergent.     

The Berry-Esseén theorem for strongly mixing Harris recurrent Markov chains

Summary Let ₀, ₁,... be a stationary Harris recurrent Markov chain with state space (E,), and let f E IR, X _i=f(_i). It is known that the sequence X _i, i0, is strongly mixing, i.e. (n)>0 where (n) are the strong (or Rosenblatt) mixing coefficients. If (n) decreases at a sufficiently fast rate and f is suitable, then a central limit holds for the partial sums . The present paper gives conditions in order that the convergence rates are O(n ^–1/2).     

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.     

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.     

Isometries of symmetric operator spaces associated with AFD factors of typeII and symmetric vector-valued spaces

If is a surjective isometry of the separable symmetric operator spaceE(M, ) associated with the approximately finite-dimensional semifinite factorM and if · _E(M,) is not proportional to · _{L 2}, then there exist a unitary operatorUM and a Jordan automorphismJ ofM such that(x)=UJ(x) for allxME(M, ). We characterize also surjective isometries of vector-valued symmetric spacesF((0, 1), E(M, )).Research supported by the Australian Research Council