Erd s–Turán Type Theorems on Quasiconformal Curves and Arcs

The theorems of Erd s and Turán mentioned in the title are concerned with the distribution of zeros of a monic polynomial with known uniform norm along the unit interval or the unit disk. Recently, Blatt and Grothmann (Const. Approx.7(1991), 19–47), Grothmann (“Interpolation Points and Zeros of Polynomials in Approximation Theory,” Habilitationsschrift, Katholische Universität Eichstätt, 1992), and Andrievskii and Blatt (J. Approx. Theory88(1977), 109–134) established corresponding results for polynomials, considered on a system of sufficiently smooth Jordan curves and arcs or piecewise smooth curves and arcs. We extend some of these results to polynomials with known uniform norm along an arbitrary quasiconformal curve or arc. As applications, estimates for the distribution of the zeros of best uniform approximants, values of orthogonal polynomials, and zeros of Bieberbach polynomials and their derivatives are obtained. We also give a negative answer to one conjecture of Eiermann and Stahl (“Zeros of orthogonal polynomials on regularN-gons,” in Lecture Notes in Math.1574(1994), 187–189).     

On the Positivity of the Fundamental Polynomials for Generalized Hermite–Fejér Interpolation on the Chebyshev Nodes

It is shown that the fundamental polynomials for (0, 1, …, 2m+1) Hermite–Fejér interpolation on the zeros of the Chebyshev polynomials of the first kind are non-negative for −1x1, thereby generalising a well-known property of the original Hermite–Fejér interpolation method. As an application of the result, Korovkin's 10theorem on monotone operators is used to present a new proof that the (0, 1, …, 2m+1) Hermite–Fejér interpolation polynomials offC[−1, 1], based onnChebyshev nodes, converge uniformly tofasn→∞.     

Constrained near-minimax approximation by weighted expansion and interpolation using Chebyshev polynomials of the second,third, and fourth kinds

Well known results on near-minimax approximation using Chebyshev polynomials of the first kind are here extended to Chebyshev polynomials of the second, third, and fourth kinds. Specifically, polynomial approximations of degreen weighted by (1–x ²)^1/2, (1+x)^1/2 or (1–x)^1/2 are obtained as partial sums of weighted expansions in Chebyshev polynomials of the second, third, or fourth kinds, respectively, to a functionf continuous on [–1, 1] and constrained to vanish, respectively, at ±1, –1 or +1. In each case a formula for the norm of the resulting projection is determined and shown to be asymptotic to 4^–2logn +A +o(1), and this provides in each case and explicit bound on the relative closeness of a minimax approximation. The constantA that occurs for the second kind polynomial is markedly smaller, by about 0.27, than that for the third and fourth kind, while the latterA is identical to that for the first kind, where the projection norm is the classical Lebesgue constant _n . The results on the third and fourth kind polynomials are shown to relate very closely to previous work of P.V. Galkin and of L. Brutman.Analogous approximations are also obtained by interpolation at zeros of second, third, or fourth kind polynomials of degreen+1, and the norms of resulting projections are obtained explicitly. These are all observed to be asymptotic to 2^–1logn +B +o(1), and so near-minimax approximations are again obtained. The norms for first, third, and fourth kind projections appear to be converging to each other. However, for the second kind projection, we prove that the constantB is smaller by a quantity asymptotic to 2^–1log2, based on a conjecture about the point of attainment of the supremum defining the projection norm, and we demonstrate that the projection itself is remarkably close to a minimal (weighted) interpolation projection.All four kinds of Chebyshev polynomials possess a weighted minimax property, and, in consequence, all the eight approximations discussed here coincide with minimax approximations when the functionf is a suitably weighted polynomial of degreen+1.     

Explicit inverse of a tridiagonal k−Toeplitz matrix

Summary We obtain explicit formulas for the entries of the inverse of a nonsingular and irreducible tridiagonal k–Toeplitz matrix A. The proof is based on results from the theory of orthogonal polynomials and it is shown that the entries of the inverse of such a matrix are given in terms of Chebyshev polynomials of the second kind. We also compute the characteristic polynomial of A which enables us to state some conditions for the existence of A^–1. Our results also extend known results for the case when the residue mod k of the order of A is equal to 0 or k–1 (Numer. Math., 10 (1967), pp. 153–161.).The work was supported by CMUC (Centro de Matemática da Universidade de Coimbra) and by Acção Integrada Luso-Espanhola E-6/03     

Expansions for the Fundamental Hermite Interpolation Polynomials in Terms of Chebyshev Polynomials

We obtain explicit expansions of the fundamental Hermite interpolation polynomials in terms of Chebyshev polynomials in the case where the nodes considered are either zeros of the (n + 1)th-degree Chebyshev polynomial or extremum points of the nth-degree Chebyshev polynomial.     

On the Bernstein Inequality for Rational Functions with a Prescribed Zero

We extend some results of Giroux and Rahman (Trans. Amer. Math. Soc.193(1974), 67–98) for Bernstein-type inequalities on the unit circle for polynomials with a prescribed zero atz=1 to those for rational functions. These results improve the Bernstein-type inequalities for rational functions. The sharpness of these inequalities is also established. Our approach makes use of the Malmquist–Walsh system of orthogonal rational functions on the unit circle associated with the Lebesgue measure.     

Erdös-Turán theorems on a system of Jordan curves and arcs

Erdös and Turán established in [4] a qualitative result on the distribution of the zeros of a monic polynomial, the norm of which is known on [–1, 1]. We extend this result to a polynomial bounded on a systemE of Jordan curves and arcs. If all zeros of the polynomial are real, the estimates are independent of the number of components ofE for any regular compact subsetE ofR. As applications, estimates for the distribution of the zeros of the polynomials of best uniform approximation and for the extremal points of the optimal error curve (generalizations of Kadec's theorem) are given.Communicated by Dieter Gaier.     

Groups of Permutation Polynomials over Finite Fields

LetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,7, 215–221) to determine the structure of all groups of permutations onFgenerated by the permutations induced by the linear polynomials and any power map which induces a permutation onF. This generalizes a result of Leonard Carlitz (1953,Proc. Amer. Math. Soc.,4, 538).     

The Nullstellensatz for Systems of PDE

Given an ideal I in , the polynomial ring in n-indeterminates, the affine variety of I is the set of common zeros in ⁿ of all the polynomials that belong to I, and the Hilbert Nullstellensatz states that there is a bijective correspondence between these affine varieties and radical ideals of . If, on the other hand, one thinks of a polynomial as a (constant coefficient) partial differential operator, then instead of its zeros in ⁿ, one can consider its zeros, i.e., its homogeneous solutions, in various function and distribution spaces. An advantage of this point of view is that one can then consider not only the zeros of ideals of , but also the zeros of submodules of free modules over (i.e., of systems of PDEs). The question then arises as to what is the analogue here of the Hilbert Nullstellensatz. The answer clearly depends on the function–distribution space in which solutions of PDEs are being located, and this paper considers the case of the classical spaces. This question is related to the more general question of embedding a partial differential system in a (two-sided) complex with minimal homology. This paper also explains how these questions are related to some questions in control theory.     

α-Stable characterization of Banach spaces (1 < α < 2)

This work characterizes some subclasses of α-stable (0 < α < 1) Banach spaces in terms of the extendibility to Radon laws of certain α-stable cylinder measures. These result extend the work of S. Chobanian and V. Tarieladze (J. Multivar. Anal.7, 183–203 (1977)). For these spaces it is shown that every Radon stable measure is the continuous image of a stable measure on a suitable L_β space with β = α(1 − α)⁻¹. The latter result extends some work of Garling (Ann. Probab.4, 600–611 (1976)) and Jain (Proceedings, Symposia in Pure Math. XXXI, p. 55–65, Amer. Math. Soc., Providence, R.I.).     

On the Divergence Phenomenon in Hermite–Fejér Interpolation

Generalizing results of L. Brutman and I. Gopengauz (1999, Constr. Approx.15, 611–617), we show that for any nonconstant entire function f and any interpolation scheme on [−1, 1], the associated Hermite–Fejér interpolating polynomials diverge on any infinite subset of \[−1, 1]. Moreover, it turns out that even for the locally uniform convergence on the open interval ]−1, 1[ it is necessary that the interpolation scheme converges to the arcsine distribution.     

Stability of best rational Chebyshev approximation

In this paper we consider best Chebyshev approximation to continuous functions by generalized rational functions using an optimization theoretical approach introduced in [[5.]]. This general approach includes, in a unified way, usual, weighted, one-sided, unsymmetric, and also more general rational Chebychev approximation problems with side-conditions. We derive various continuity conditions for the optimal value, for the feasible set, and the optimal set of the corresponding optimization problem. From these results we derive conditions for the upper semicontinuity of the metric projection, which include some of the results of Werner [On the rational Tschebyscheff operator, Math. Z. 86 (1964), 317–326] and Cheney and Loeb [On the continuity of rational approximation operators, Arch. Rational Mech. Anal. 21 (1966), 391–401].     

Laurent–Padé Approximants to Four Kinds of Chebyshev Polynomial Expansions. Part I. Maehly Type Approximants

Laurent Padé–Chebyshev rational approximants, A _m (z,z ^–1)/B _n (z,z ^–1), whose Laurent series expansions match that of a given function f(z,z ^–1) up to as high a degree in z,z ^–1 as possible, were introduced for first kind Chebyshev polynomials by Clenshaw and Lord [2] and, using Laurent series, by Gragg and Johnson [4]. Further real and complex extensions, based mainly on trigonometric expansions, were discussed by Chisholm and Common [1]. All of these methods require knowledge of Chebyshev coefficients of f up to degree m+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions between f(z,z ^–1)B _n (z,z ^–1) and A _m (z,z ^–1). The derivation was relatively simple but required knowledge of Chebyshev coefficients of f up to degree m+2n. In the present paper, Padé–Chebyshev approximants are developed not only to first, but also to second, third and fourth kind Chebyshev polynomial series, based throughout on Laurent series representations of the Maehly type. The procedures for developing the Padé–Chebyshev coefficients are similar to that for a traditional Padé approximant based on power series [8] but with essential modifications. By equating series coefficients and combining equations appropriately, a linear system of equations is successfully developed into two sub-systems, one for determining the denominator coefficients only and one for explicitly defining the numerator coefficients in terms of the denominator coefficients. In all cases, a type (m,n) Padé–Chebyshev approximant, of degree m in the numerator and n in the denominator, is matched to the Chebyshev series up to terms of degree m+n, based on knowledge of the Chebyshev coefficients up to degree m+2n. Numerical tests are carried out on all four Padé–Chebyshev approximants, and results are outstanding, with some formidable improvements being achieved over partial sums of Laurent–Chebyshev series on a variety of functions. In part II of this paper [7] Padé–Chebyshev approximants of Clenshaw–Lord type will be developed for the four kinds of Chebyshev series and compared with those of the Maehly type.     

Cross-validation and the smoothing of orthogonal series density estimators

We describe a class of smoothed orthogonal series density estimates, including the classical sequential-series introduced by [6], Soviet Math. Dokl. 3 1559–1562) and [16], Ann. Math. Statist. 38 1261–1265), and [23], Ann. Statist 9 146–156) two-parameter smoothing. The Bowman-Rudemo method of least-squares cross-validation (1982, Manchester-Sheffield School of Probability and Statistics Research Report 84/AWB/1; 1984, Biometrika 71 353–360; [14], Scand. J. Statist. 9 65–78), is suggested as a practical way of choosing smoothing parameters automatically. Using techniques of [18], Ann. Statist. 12 1285–1297), that method is shown to perform asymptotically optimally in the case of cosine and Hermite series estimators. The same argument may be used for other types of series.     

On equivalence of moduli of smoothness of polynomials in ,

It is well known that for functions , 1p∞. For general functions fL_p, it does not hold for 0<p<1, and its inverse is not true for any p in general. It has been shown in the literature, however, that for certain classes of functions the inverse is true, and the terms in the inequalities are all equivalent. Recently, Zhou and Zhou proved the equivalence for polynomials with p=∞. Using a technique by Ditzian, Hristov and Ivanov, we give a simpler proof to their result and extend it to the L_p space for 0<p∞. We then show its analogues for the Ditzian–Totik modulus of smoothness and the weighted Ditzian–Totik modulus of smoothness for polynomials with .     

Riemann–Hilbert analysis for Jacobi polynomials orthogonal on a single contour

Classical Jacobi polynomials , with α,β>-1, have a number of well-known properties, in particular the location of their zeros in the open interval (-1,1). This property is no longer valid for other values of the parameters; in general, zeros are complex. In this paper we study the strong asymptotics of Jacobi polynomials where the real parameters α_n,β_n depend on n in such a way that

with . We restrict our attention to the case where the limits A,B are not both positive and take values outside of the triangle bounded by the straight lines A=0, B=0 and A+B+2=0. As a corollary, we show that in the limit the zeros distribute along certain curves that constitute trajectories of a quadratic differential.The non-hermitian orthogonality relations for Jacobi polynomials with varying parameters lie in the core of our approach; in the cases we consider, these relations hold on a single contour of the complex plane. The asymptotic analysis is performed using the Deift–Zhou steepest descent method based on the Riemann–Hilbert reformulation of Jacobi polynomials.     

Near-best multivariate approximation by Fourier series, Chebyshev series and Chebyshev interpolation

A set of results concerning goodness of approximation and convergence in norm is given for L_∞ and L₁ approximation of multivariate functions on hypercubes. Firstly the trigonometric polynomial formed by taking a partial sum of a multivariate Fourier series and the algebraic polynomials formed either by taking a partial sum of a multivariate Chebyshev series of the first kind or by interpolating at a tensor product of Chebyshev polynomial zeros are all shown to be near-best L_∞ approximations. Secondly the trigonometric and algebraic polynomials formed by taking, respectively, a partial sum of a multivariate Fourier series and a partial sum of a multivariate Chebyshev series of the second kind are both shown to be hear-best L₁ approximations. In all the cases considered, the relative distance of a near-best approximation from a corresponding best approximation is shown to be at most of the order of Π log n_j, where n_j (j = 1, 2,…, N) are the respective degrees of approximation in the N individual variables. Moreover, convergence in the relevant norm is established for all the sequences of near-best approximations under consideration, subject to appropriate restrictions on the function space.     

Chebyshev's recursion: Analytic principles and applications

We study different algebraic and algorithmic constructions related to the scalar product on the space of polynomials defined on the real axis and on the unit circle and to the Chebyshev procedure. A modern version of the Chebyshev recursion ((m)–T-recursion) is applied to check whether the Hankel and Toeplitz quadratic forms are positive definite, to determine the number of real (complex conjugate) roots of the polynomials, to localize the ordering of these roots, and to find bounds for the values of a function on a given set. We also consider the relation between the (m)–T-recursion and the method of moments in the study of Schrödinger operators for special classes of potentials.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 5, pp. 626–646, May, 1993.     

Strict convexity of sequence Orlicz-Musielak spaces with Orlicz norm

H. Milnes gave in (Pacific J. Math. 18 (1957), 1451–1483) a criterion for strict convexity of Orlicz spaces with respect to the so called Orlicz norm, in the case of nonatomic measure and a usual Young function. Here there are presented necessary and sufficient conditions for strict convexity of Orlicz-Musielak spaces (J. Musielak and W. Orlicz, Studia Math. 18 (1957), 49–65) with Orlicz norm in the case of purely atomic measure. For sequence Orlicz-Musielak spaces with Luxemburg norm, such a criterion is given in (A. Kami ska, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 29 (1981), 137–144).     

On the Domain of Divergence of Hermite–Fejér Interpolating Polynomials

Recently, the study of the behavior of the Hermite–Fejér interpolants in the complex plane was initiated by L. Brutman and I. Gopengauz (1999, Constr. Approx.15, 611–617). It was shown that, for a broad class of interpolatory matrices on [−1, 1], the sequence of polynomials induced by Hermite–Fejér interpolation to f(z)≡z diverges everywhere in the complex plane outside the interval of interpolation [−1, 1]. In this note we amplify this result and prove that the divergence phenomenon takes place without any restriction on the interpolatory matrices.