Summability of Fourier orthogonal series for Jacobi weight on a ball in

Fourier orthogonal series with respect to the weight function
on the unit ball in are studied. Compact formulae for the sum of the product of orthonormal polynomials in several variables and for the reproducing kernel are derived and used to study the summability of the Fourier orthogonal series. The main result states that the expansion of a continuous function in the Fourier orthogonal series with respect to is uniformly summable on the ball if and only if .

     

Orthogonal polynomial eigenfunctions of second-order partial differerential equations

In this paper, we show that for several second-order partial differential equations

which have orthogonal polynomial eigenfunctions, these polynomials can be expressed as a product of two classical orthogonal polynomials in one variable. This is important since, otherwise, it is very difficult to explicitly find formulas for these polynomial solutions. From this observation and characterization, we are able to produce additional examples of such orthogonal polynomials together with their orthogonality that widens the class found by H. L. Krall and Sheffer in their seminal work in 1967. Moreover, from our approach, we can answer some open questions raised by Krall and Sheffer.

     

Explicit merit factor formulae for Fekete and Turyn polynomials

We give explicit formulas for the norm (or equivalently for the merit factors) of various sequences of polynomials related to the Fekete polynomials

where is the Legendre symbol. For example for an odd prime,

where is the class number of . Similar explicit formulas are given for various polynomials including an example of Turyn's that is constructed by cyclically permuting the first quarter of the coefficients of . This is the sequence that has the largest known asymptotic merit factor. Explicitly,

where denotes the nearest integer, satisfies

where

Indeed we derive a closed form for the norm of all shifted Fekete polynomials

Namely

and if .

     

An extremal property of Fekete polynomials

The Fekete polynomials are defined as

where is the Legendre symbol. These polynomials arise in a number of contexts in analysis and number theory. For example, after cyclic permutation they provide sequences with smallest known norm out of the polynomials with coefficients.

The main purpose of this paper is to prove the following extremal property that characterizes the Fekete polynomials by their size at roots of unity.

Theorem 0.1. Let with odd and . If

then must be an odd prime and is . Here

This result also gives a partial answer to a problem of Harvey Cohn on character sums.

     

Integral formulas for Chebyshev polynomials and the error term of interpolatory quadrature formulae for analytic functions

We evaluate explicitly the integrals , with the being any one of the four Chebyshev polynomials of degree . These integrals are subsequently used in order to obtain error bounds for interpolatory quadrature formulae with Chebyshev abscissae, when the function to be integrated is analytic in a domain containing in its interior.

     

Orthogonal Polynomials and Expansions for a Family of Weight Functions in Two Variables

Orthogonal polynomials for a family of weight functions on [?1,1]², $$\mathcal{W}_{\alpha,\beta,\gamma}(x,y) = |x+y|^{2\alpha+1}|x-y|^{2\beta+1} \bigl(1-x^2\bigr)^{\gamma}\bigl(1-y^2\bigr)^{\gamma},$$ are studied and shown to be related to the Koornwinder polynomials defined on the region bounded by two lines and a parabola. In the case of ??=±1/2, an explicit basis of orthogonal polynomials is given in terms of Jacobi polynomials, and a closed formula for the reproducing kernel is obtained. The latter is used to study the convergence of orthogonal expansions for these weight functions.     

Asymptotics and weighted estimates of meixner polynomials orthogonal on the gird {0, δ, 2δ, ...}

Suppose that 0<δ≤1,N=1/δ, and α, ga≥0, is an integer. For the classical Meixner polynomials orthonormal on the gird {0, δ, 2δ, ...} with weight ρ(x)=(1-e ^−δ)^αг(Nx+α+ 1)/г(Nx+1), the following asymptotic formula is obtained: . The remainderv _n,N ^α (z) forn≤λN satisfies the estimate

The expected norm of random polynomials

The results of this paper concern the expected norm of random polynomials on the boundary of the unit disc (equivalently of random trigonometric polynomials on the interval ). Specifically, for a random polynomial

let

Assume the random variables , are independent and identically distributed, have mean 0, variance equal to 1 and, if 2$">, a finite moment . Then

and

as .

In particular if the polynomials in question have coefficients in the set (a much studied class of polynomials), then we can compute the expected norms of the polynomials and their derivatives

and

This complements results of Fielding in the case, Newman and Byrnes in the case, and Littlewood et al. in the case.

     

Asymptotic zero distribution of hypergeometric polynomials

We show that the zeros of the hypergeometric polynomials , , cluster on the loop of the lemniscate as . We also state the equations of the curves on which the zeros of , lie asymptotically as . Auxiliary results for the asymptotic zero distribution of other functions related to hypergeometric polynomials are proved, including Jacobi polynomials with varying parameters and associated Legendre functions. Graphical evidence is provided using Mathematica. This revised version was published online in June 2006 with corrections to the Cover Date.     

Monic integer Chebyshev problem

We study the problem of minimizing the supremum norm by monic polynomials with integer coefficients. Let denote the monic polynomials of degree with integer coefficients. A monic integer Chebyshev polynomial satisfies

and the monic integer Chebyshev constant is then defined by

This is the obvious analogue of the more usual integer Chebyshev constant that has been much studied.

We compute for various sets, including all finite sets of rationals, and make the following conjecture, which we prove in many cases.

Conjecture. Suppose is an interval whose endpoints are consecutive Farey fractions. This is characterized by Then

This should be contrasted with the nonmonic integer Chebyshev constant case, where the only intervals for which the constant is exactly computed are intervals of length 4 or greater.

     

Jacobi polynomials from compatibility conditions

We revisit the ladder operators for orthogonal polynomials and re-interpret two supplementary conditions as compatibility conditions of two linear over-determined systems; one involves the variation of the polynomials with respect to the variable (spectral parameter) and the other a recurrence relation in (the lattice variable). For the Jacobi weight

we show how to use the compatibility conditions to explicitly determine the recurrence coefficients of the monic Jacobi polynomials.

     

Convex linear combinations of sequences of monic orthogonal polynomials

For a sequence of monic orthogonal polynomials (SMOP), with respect to a positive measure supported on the unit circle, we obtain necessary and sufficient conditions on a SMOP in order that a convex linear combination with be a SMOP with respect to a positive measure supported on the unit circle.

     

Convex Optimal Designs for Compound Polynomial Extrapolation

The extrapolation design problem for polynomial regression model on the design space [–1,1] is considered when the degree of the underlying polynomial model is with uncertainty. We investigate compound optimal extrapolation designs with two specific polynomial models, that is those with degrees |m, 2m}. We prove that to extrapolate at a point z, |z| > 1, the optimal convex combination of the two optimal extrapolation designs | _m ^* (z), _2m ^* (z)} for each model separately is a compound optimal extrapolation design to extrapolate at z. The results are applied to find the compound optimal discriminating designs for the two polynomial models with degree |m, 2m}, i.e., discriminating models by estimating the highest coefficient in each model. Finally, the relations between the compound optimal extrapolation design problem and certain nonlinear extremal problems for polynomials are worked out. It is shown that the solution of the compound optimal extrapolation design problem can be obtained by maximizing a (weighted) sum of two squared polynomials with degree m and 2m evaluated at the point z, |z| > 1, subject to the restriction that the sup-norm of the sum of squared polynomials is bounded.     

Hankel determinants of some polynomials arising in combinatorial analysis

In this paper we investigate Hankel determinants of the form , where c _n (t) is one of a number of polynomials of combinatorial interest. We show how some results due to Radoux may be generalized, and also show how “stepped up” Hankel determinants of the form may be evaluated. This revised version was published online in June 2006 with corrections to the Cover Date.     

An estimate for the number of bound states of the Schrödinger operator in two dimensions

For the Schrödinger operator on let be the number of bound states. One obtains the following estimate:

where and ( is the Euler constant). This estimate holds for all potentials for which the previous integral is finite.

     

Nondiagonal Hermite–Sobolev Orthogonal Polynomials

In this work, we study algebraic and analytic properties for the polynomials { Q _n } _{n 0}, which are orthogonal with respect to the inner product where , R such that – ² > 0.     

An improved Mordell type bound for exponential sums

For a sparse polynomial , with and , we show that

thus improving upon a bound of Mordell. Analogous results are obtained for Laurent polynomials and for mixed exponential sums.

     

Second-Order Subelliptic Operators on Lie Groups I: Complex Uniformly Continuous Principal Coefficients

We consider second-order subelliptic operators with complex coefficients over a connected Lie group G. If the principal coefficients are right uniformly continuous then we prove that the operators generate strongly continuous holomorphic semigroups with kernels K satisfying Gaussian bounds. Moreover, the kernels are Hölder continuous and for each 0, 1 and > 0 one has estimates

On differential equations for Sobolev-type Laguerre polynomials

The Sobolev-type Laguerre polynomials are orthogonal with respect to the inner product

where , and . In 1990 the first and second author showed that in the case and the polynomials are eigenfunctions of a unique differential operator of the form

where are independent of . This differential operator is of order if is a nonnegative integer, and of infinite order otherwise. In this paper we construct all differential equations of the form

where the coefficients , and are independent of and the coefficients , and are independent of , satisfied by the Sobolev-type Laguerre polynomials . Further, we show that in the case and the polynomials are eigenfunctions of a linear differential operator, which is of order if is a nonnegative integer and of infinite order otherwise. Finally, we show that in the case and the polynomials are eigenfunctions of a linear differential operator, which is of order if is a nonnegative integer and of infinite order otherwise.

     

Marcinkiewicz's theorem on operator multipliers of Fourier series

We give some sufficient conditions on the operators which for each imply the inequality