Approximation under an arc length constraint

Let f C[a, b]. LetP be a subset ofC[a, b], L b – a be a given real number. We say thatp P is a best approximation tof fromP, with arc length constraintL, ifA[p] _b ^a [1 + (p(x)) ²]dx L andp – f q – f for allq P withA[q] L. represents an arbitrary norm onC[a, b]. The constraintA[p] L might be interpreted physically as a materials constraint.In this paper we consider the questions of existence, uniqueness and characterization of constrained best approximations. In addition a bound, independent of degree, is found for the arc length of a best unconstrained Chebyshev polynomial approximation.The work of L. L. Keener is supported by the National Research Council of Canada Grant A8755.     

On the divergence of certain Hermite-Fejér interpolation

Summary In his paper [1]P. Turán discovers the interesting behaviour of Hermite-Fejér interpolation (based on the ebyev roots) not describing the derivative values at exceptional nodes {_n} _n=1 . Answering to his question we construct such exceptional node-sequence for which the mentioned process is bounded for bounded functions whenever –1<x<1 but does not converge for a suitable continuous function at any point of the whole interval [–1, 1].     

Quasi-coherence of Hardy spaces in several complex variables

In this paper, we prove that the Hardy spaceH ^p (), 1p<, over a strictly pseudoconvex domain in ⁿ with smooth boundary is quasi-coherent. More precisely, we show that Toeplitz tuplesT with suitable symbols onH ^p () have property (). This proof is based on a well known exactness result for the tangential Cauchy-Riemann complex.     

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.     

Interpolating them-th power ofx at the zeros of then-th Chebyshev-polynomial yields an almost best Chebyshev-approximation

LetX={x ₁,x ₂,..., _n }I=[–1, 1] and . ForfC ₁(I) definef* byf–p _f =f*, wherep _f denotes the interpolation-polynomial off with respect toX. We state some properties of the operatorf f*. In particular, we treat the case whereX consists of the zeros of the Chebyshev polynomialT _n (x) and obtain x ^m –p _x ^m8eE _n–1(x ^m ), whereE _n–1(f) denotes the sup-norm distance fromf to the polynomials of degree less thann. Finally we state a lower estimate forE _n (f) that omits theassumptionf ⁽ⁿ⁺¹⁾>0 in a similar estimate of Meinardus.     

Mixing and some integro-functional equations

Summary It is proved that the operatorP: L ¹ (0, ) L ¹(0, ), given byPg(z) = _z/c [g(x)/cx]dx, is completely mixing, i.e.,P ⁿ g ₁ 0 forg L ¹(0, ) with g dx = 0. This implies that, forc (0, 1), each continuous and bounded solution of the equationf(x)= ₀ ^cx f(t)dt/(cx) (x (0, 1]) is constant.     

On the asymptotic and invariantσ-algebras of random walks on locally compact groups

Summary Consider a random walk of law on a locally compact second countable groupG. Let the starting measure be equivalent to the Haar measure and denote byQ the corresponding Markov measure on the space of pathsG . We study the relation between the spacesL (G , ^a ,Q) andL (G , ⁱ ,Q) where ^a and ⁱ stand for the asymptotic and invariant -algebras, respectively. We obtain a factorizationL (G , ^a ,Q) L (G , ⁱ ,Q)L (C) whereC is a cyclic group whose order (finite or infinite) coincides with the period of the Markov shift and is determined by the asymptotic behaviour of the convolution powers ⁿ.     

Effilement minimal en une singularité isolée de l'équation de Schrödinger et application au principe de Picard

In this paper, the generalized Schrödinger equation (–)u=0 on the punctured unit disk of ² is investigated. If is rotation free and satisfies the Picard principle at the origin, it is shown that if a setE is minimal thin relatively to an extremal harmonic functionh with zero boundary values at {|x|=1}, there exists a sequence (r _n ) converging to zero such that B(O,r _n ) C E. Lete be the -unit. It is proved that if a measure satisfies _\E e h d<, for a minimal thin, relatively toh , setE then the Picard principle is valid for the measure + .

     

On the product of sign vectors and unit vectors

For a fixed unit vectora=(a ₁,...,a _n )S ^n-1, consider the 2 ⁿ sign vectors=(₁,..., _n ){±1{ ⁿ and the corresponding scalar products^·a = _n ⁱ⁼¹ = _i a _i . The question that we address is: for how many of the sign vectors must^.a lie between–1 and 1. Besides the straightforward interpretation in terms of the sums ±a ₂ , this question has appealing reformulations using the language of probability theory or of geometry.The natural conjectures are that at least 1/2 the sign vectors yield |.a|1 and at least 3/8 of the sign vectors yield |.a|<1 (the latter excluding the case when |a _i |=1 for somei). These conjectured lower bounds are easily seen to be the best possible. Here we prove a lower bound of 3/8 for both versions of the problem, thus completely solving the version with strict inequality. The main part of the proof is cast in a more general probabilistic framework: it establishes a sharp lower bound of 3/8 for the probability that |X+Y|<1, whereX andY are independent random variables, each having a symmetric distribution with variance 1/2.We also consider an asymptotic version of the question, wheren along a sequence of instances of the problem satisfying ||a||0. Our result, best expressed in probabilistic terms, is that the distribution of .a converges to the standard normal distribution, and in particular the fraction of sign vectors yielding .a between –1 and 1 tends to 68%.This research was supported in part by the Institute for Mathematics and its Applications with funds provided by the National Science Foundation.     

Transfinite interpolation on the medians of a triangle and best L 1-approximation

Let be a triangle in and let be the set of its three medians. We construct interpolants to smooth functions using transfinite (or blending) interpolation on The interpolants are of type f(₁)+g(₂)+h(₃), where (₁,₂,₃) are the barycentric coordinates with respect to the vertices of . Based on an error representation formula, we prove that the interpolant is the unique best L¹-approximant by functions of this type subject the function to be approximated is from a certain convexity cone in C³().Received: 17 December 2003     

(q, δ)-Numeration Systems with Missing Digits

We consider the (q, ) numeration system, with basis q2 and the set of digits {, +1,,q+–1} where –(q–1)0. We study properties of numbers where some digits do not occur. This is analogous to the Cantor set {0.a₁a₂a_i{0,2}}. We compute an asymptotic equivalent of the nth moment of the Cantor (q, D)-distribution which can be described as the numbers 0. w₁w₂ with w_iD{,,q+–1}, and each such letter can occur with the same probability 1/CardD. Furthermore, we consider n random strings according to the distribution and the expected minimum of them. We find a recursion which we solve asymptotically.This author was supported by the CNRS/NRF-project no 10959. Part of this work was done during the first authors visit to the John Knopfmacher Centre for Applicable Analysis and Number Theory at the University of the Witwatersrand, Johannesburg, South Africa.This author was supported by the CNRS/NRF-project no 10959.     

An error analysis for absolute and relative approximation

We consider the vectorial algorithm for finding best polynomial approximationsp P _n to a given functionf C[a, b], with respect to the norm · _s , defined byp – f _s =w ₁ (p – f)+w ₂ (p – f) A bound for the modulus of continuity of the best vectorial approximation operator is given, and using the floating point calculus of J. H. Wilkinson, a bound for the rounding error in the algorithm is derived. For givenf, these estimates provide an indication of the conditioning of the problem, an estimate of the obtainable accuracy, and a practical method for terminating the iteration.This paper was supported in part by the Canadian NCR A-8108, FCAC 74-09 and G.E.T.M.A.Part of this research was done during the first-named author's visit to theB! Chair of Applied Mathematics, University of Athens, Spring term, 1975.     

Stability radius of polynomials occurring in the numerical solution of initial value problems

This paper deals with polynomial approximations(x) to the exponential function exp(x) related to numerical procedures for solving initial value problems. Motivated by stability requirements, we present a numerical study of the largest diskD()={z C: |z+|} that is contained in the stability regionS()={z C: |(z)|1}. The radius of this largest disk is denoted byr(), the stability radius. On the basis of our numerical study, several conjectures are made concerningr _m,p=sup {r(): _m,p}. Here _{m, p} (1pm; p, m integers) is the class of all polynomials(x) with real coefficients and degree m for which(x)=exp(x)+O(x ^p+1) (forx 0).     

Sûto's method applied to a problem of Färe and Mitchell

Summary A real solution of the functional equation(x + (y – x)) = f(x) + g(y) + h(x)k(y) on a set ² is a 6-tuple (f, g, h, k, , ) of real valued functions such that the equation is identically fulfilled on. Except for cases known before—e.g. when is linear—we present all real solutions in an arbitrary region where the functions have derivatives of second order.     

Smoothness of solutions of a nonlinear ode

Smoothness of aC -functionf is measured by (Carleman) sequence {M _k} ₀ ; we sayfC _M [0, 1] if|f ^(k) (t)|CR ^k M _k,k=0, 1, ... withC, R>0. A typical statement proven in this paper isTHEOREM: Let u, b be two C -functions on [0, 1]such that (a) u=u ²+b, (b) |b ^(k) (t)|CR ^k (k!) , >1,k_–.Then |u^(k)(t)|C₁R^k((k–1)!),k_–.The first author acknowledges the hospitality of Mathematical Research Institute of the Ohio State University during his one month visit there in the spring of 1999     

Algebraic polynomial bases of space LP

Let (_n) be a system, close to the orthonormal complete system (x _n). An estimate is obtained for the deviation of the system {f_n}, obtained from {_n} by Schmidt's method, from the system {x_n}. This estimate is used to show that, in any L_P(–1,1), withp (1,4/3] [4,), and for any >e¦4 = i,13..., there exists an orthogonal algebraic system (P _n (x)) _n=0 , forming a basis in L_P and such that _n = degP _n (x) n for n>n_o(p,).Translated from Matematicheskie Zametki, Vol. 23, No. 2, pp. 223–230, February, 1978.     

Application of Hermite-Mahler polynomials to the approximation of the values ofp-adic exponential function

We shall give a further application of Hermite-Mahler polynomials to the consideration ofp-adic exponential function. An effective lower bound is obtained for max {| – | _p ,P(e )| _p }, where is an algebraic number satisfying || _p <p ^–/(p–1), and 0 is ap-adic number with | | _p depending on the degree of the polynomialPZ[y]. The bound obtained implies the transcendence ofe if ap-adic number satisfying 0 < || _p <p ^–/(p–1) is algebraic or can be well approximated by algebraic numbers.This work was carried out while the author was a research fellow of the Alexander von Humboldt Foundation.     

On a problem proposed by H. Braß concerning the remainder term in quadrature for convex functions

Summary We prove that the error inn-point Gaussian quadrature, with respect to the standard weight functionw1, is of best possible orderO(n ^–2) for every bounded convex function. This result solves an open problem proposed by H. Braß and published in the problem section of the proceedings of the 2. Conference on Numerical Integration held in 1981 at the Mathematisches Forschungsinstitut Oberwolfach (Hämmerlin 1982; Problem 2). Furthermore, we investigate this problem for positive quadrature rules and for general product quadrature. In particular, for the special class of Jacobian weight functionsw _, (x)=(1–x)(1+x), we show that the above result for Gaussian quadrature is not valid precisely ifw _, is unbounded.Dedicated to Prof. H. Braß on the occasion of his 55th birthday     

Symmetric balanced ternary designs with ϱ1 = 1 or 2

Summary We prove the following two non-existence theorems for symmetric balanced ternary designs. If ₁ = 1 and 0 (mod 4) then eitherV = + 1 or 4₂ – + 1 is a square and (4₂ – + 1) divides ² – 1. If ₁ = 2 thenV = ((m + 1)/2) ² + 2,K = (m ² + 7)/4 and = ((m – 1)/2)² + 1 wherem 3 (mod 4). An example belonging to the latter series withV = 18 is constructed.     

Interfaces and typical Gibbs configurations for one-dimensional Kac potentials

Summary We consider a one dimensional Ising spin system with a ferromagnetic Kac potential J(|r|),J having compact support. We study the system in the limit, »0, below the Lebowitz-Penrose critical temperature, where there are two distinct thermodynamic phases with different magnetizations. We prove that the empirical spin average in blocks of size ^–1 (for any positive ) converges, as »0, to one of the two thermodynamic magnetizations, uniformly in the intervals of size ^–p , for any given positivep1. We then show that the intervals where the magnetization is approximately constant have lengths of the order of exp(c ^–1),c>0, and that, when normalized, they converge to independent variables with exponential distribution. We show this by proving large deviation estimates and applying the Ventsel and Friedlin methods to Gibbs random fields. Finally, if the temperature is low enough, we characterize the interface, namely the typical magnetization pattern in the region connecting the two phases.The research has been partially supported by CNR, GNFM, GNSM and by grant SC1CT91-0695 of the Commission of European Communities