The spectrum of Jacobi matrices in terms of its associated weight function

Using the so-called Lanczos procedure of orthogonalization a method is developed to calculate the elements of a N-dimensional Jacobi matrix and/or the coefficients of the three-term recurrence relation of a system of orthogonal polynomials {P_m(x), m = 0, 1, 2, ?, N} in terms of the moments μ_r^′(1) of its associated weight function. The eigenvalue density ?^(N)(x) and its asymptotical limit, i.e. when N tends to infinite, are also calculated in terms of μ_r^′(1). The method is used to determine the functions ?^(N)(x) and ?(x) for some known weight functions, like the normal distribution, the uniform distribution, the semicircular distribution and the gamma or Pearson type III distribution. As a byproduct the asymptotical density of zeros of Chebyshev, Legendre and generalized Laguerre polynomials are found.     

Zeros of Sobolev orthogonal polynomials following from coherent pairs

Let {S_n^λ} denote the monic orthogonal polynomial sequence with respect to the Sobolev inner product$\text{〈f,g〉}{}_{\mathrm{S}}\text{=}\text{∫}\text{−∞}\text{∞}\text{fg}\text{d}\text{ψ}{}_0\text{+λ}\text{∫}\text{−∞}\text{∞}\text{f′g′}\text{d}\text{ψ}{}_1\text{,}$where {dψ₀,dψ₁} is a so-called coherent pair and λ>0. Then S_n^λ has n different, real zeros. The position of these zeros with respect to the zeros of other orthogonal polynomials (in particular Laguerre and Jacobi polynomials) is investigated. Coherent pairs are found where the zeros of S_n−1^λ separate the zeros of S_n^λ.     

On a general system of orthogonal q-polynomials

A general set of orthogonal q-polynomials {P_m (x); m = 0, 1, 2, …, N} is introduced and characterized by its three-term recursion relation. This set unifies many of the different known systems of orthogonal q-polynomials, e.g. the Stieltjes-Wigert polynomials and their several generalizations, the Brenke-Chihara polynomials, the Al Salam-Carlitz polynomials, the Al Salam-Chihara polynomials, …. Compact expressions of the moments of the asymptotical density of zeros of this global set of q-polynomials are explicitly found in terms of the coefficients of the three-term recurrence relation. As an example the asymptotical density of zeros of the known, above-mentioned systems of orthogonal q-polynomials are calculated through its moments.     

Recurrence relation for biorthogonal polynomials

We use a geometric approach to obtain a recurrence relation for two families of biorthogonal polynomials associated to a nonsingular, strongly regular matrix M. We propose a “look-ahead procedure” for computing the biorthogonal polynomials when M has singular or ill-conditioned leading principal submatrices. These polynomials lead to two recursive triangular factorizations for the inverse of a nonsingular matrix M which is not necessarily strongly regular.     

A generalization of the class laguerre polynomials: asymptotic properties and zeros

We consider a modification of the gamma distribution by adding a discrete measure Support in the point x = 0. We study some properties of the polynomials orthogonal with respect to such measures [1]. In particular, we deduce the second order differential to'1ttatiolt and the three term recurrence relation which such polynomials satisfy as well as, for large n. the behaviour of their zeros.     

On Lp-convergence of Grunwald interpolation

In this paper, the L_p-convergence of Grünwald interpolation G_n(f,x) based on the zeros of Jacobi polynomials J _n ^(α,β) (x)(−1<α,β<1) is considered. L_p-convergence (0<p<2) of Grünwald interpolation G_n(f,x) is proved for p·Max(α,β)<1. Moreover, L_p-convergence (p>0) of G_n(f,x) is obtained for −1<α,β≤0. Therefore, the results of [1] and [3–5] are improved.     

A completely monotonic function involving the tri- and tetra-gamma functions

The di-gamma function ψ(x) is defined on (0,∞) by $\psi (x) = \frac{{\Gamma '(x)}} {{\Gamma (x)}} $ and ψ ⁽ⁱ⁾(x) for i ∈ ? denote the polygamma functions, where Γ(x) is the classical Euler’s gamma function. In this paper we prove that a function involving the difference between [ψ′(x)]² + ψ″(x) and a proper fraction of x is completely monotonic on (0,∞).     

Bi-unitary perfect polynomials overGF(g)

Summary This paper continues the author's excursions into the arithmetic of polynomials over finite fields. For monic polynomials A, B GF[q, x] where p is a prime, q=p^dand d 1: The divisor B of A is a bi-unitary divisor of A provided 1 is the greatest common unitary divisor of the polynomials B and A/B, and we say that A is bi-unitary perfect (b.u.p.) over GF(q) provided A equals the sum ^**(A) of the distinct bi-unitary divisors of A in GF[q, x]. A diversity of b.u.p. polynomials over GF(q) is found, some of which are neither perfect nor unitary perfect. For p > 2 we can only conjecture a characterisation of the b.u.p. polynomials which split in GF[p, x], so several open questions remain. Examples of non-splitting b.u.p. polynomials over GF(p) are given for p=2, 3, 5 which, in turn, allow the construction of such examples over GF(p^d) for these p.     

Bezoutians and projections

With each polynomial p of degree n whose roots lie inside the unit disc we may associate the n-dimensional space of all solutions of the recurrence relation whose coefficients are those of p (considered as a subspace of 1²). The main result consists in establishing a close relation between the Bezoutian of two such polynomials (of the same degree) and the projection operator onto one of the corresponding spaces along the complement of the other. The note forms a loose continuation of the author's investigations of the infinite companion matrix—the generating function of the infinite companion matrix of a polynomial p appears thus as a particular case; the corresponding Bezoutian is that of the pair p and zⁿ.     

Connection coefficients for Laguerre-Sobolev orthogonal polynomials

Laguerre-Sobolev polynomials are orthogonal with respect to an inner product of the form , where α>−1, λ?0, and , the linear space of polynomials with real coefficients. If dμ(x)=xαe−xdx, the corresponding sequence of monic orthogonal polynomials {Q_n^(α,λ)(x)} has been studied by Marcellán et al. (J. Comput. Appl. Math. 71 (1996) 245-265), while if dμ(x)=δ(x)dx the sequence of monic orthogonal polynomials {L_n^(α)(x;λ)} was introduced by Koekoek and Meijer (SIAM J. Math. Anal. 24 (1993) 768-782). For each of these two families of Laguerre-Sobolev polynomials, here we give the explicit expression of the connection coefficients in their expansion as a series of standard Laguerre polynomials. The inverse connection problem of expanding Laguerre polynomials in series of Laguerre-Sobolev polynomials, and the connection problem relating two families of Laguerre-Sobolev polynomials with different parameters, are also considered.     

Inner product quadrature formulas exact on maximal product spaces of functions

This work extends and complements earlier work of the author [1]. An Inner Product Quadrature Formula (I P Q F) is used when approximating the definite integral of the product of two (or more) funcitons, i.e. σ_?1¹w(x) f(x) g(x) dx, where w is a weight function. The functions f and g are approximated by interpolatory functions f_φ? span φ_{ii = 0}^γ, g_ψ? span ψj_{j = 0}^δ, and the integral σ_?1¹w(x)f_φ(x)g_ψ (x) dx is evaluated exactly. Maximal values which the numbers γ and δ may take are investigated. Numerical examples of I P Q F are given. Also, the applicaitons of I P Q F in higher dimensions are commented on.     

Uniform asymptotics and zeros of a system of orthogonal polynomials defined via a difference equation

We study a class of sieved Pollaczek polynomials defined by a second-order difference equation (three-term recurrence relation). The measure of orthogonality is determined by using the Markov theorem and the Perron-Stieltjes inversion formula, and is shown consisting of an absolutely continuous part and a discrete part with infinitely many mass points. Uniform asymptotic approximations of these polynomials for large degree n are derived at a turning point αn and a critical point βn, involving respectively the Airy function Ai, and . Darboux's method, the method of steepest descents, and various uniform asymptotic techniques such as cubic transformations are used to derive the results. Asymptotic formulas for the least zeros, the largest zeros, and the zeros on both sides of βn are also obtained. Several numerical examples are provided to compare the approximate zeros with the true values.     

Mixed recurrence relations and interlacing of the zeros of some q-orthogonal polynomials from different sequences

We use the generating functions of some q-orthogonal polynomials to obtain mixed recurrence relations involving polynomials with shifted parameter values. These relations are used to prove interlacing results for the zeros of Al-Salam-Chihara, continuous q-ultraspherical, q-Meixner-Pollaczek and q-Laguerre polynomials of the same or adjacent degree as one of the parameters is shifted by integer values or continuously within a certain range. Numerical examples are given to illustrate situations where the zeros do not interlace.     

Systems of orthogonal polynomials arising from the modular j-function

Let be the polynomial whose zeros are the j-invariants of supersingular elliptic curves over . Generalizing a construction of Atkin described in a recent paper by Kaneko and Zagier (Computational Perspectives on Number Theory (Chicago, IL, 1995), AMS/IP 7 (1998) 97-126), we define an inner product on for every . Suppose a system of orthogonal polynomials {P_n,ψ(x)}_n=0^∞ with respect to exists. We prove that if n is sufficiently large and ψ(x)P_n,ψ(x) is p-integral, then over . Further, we obtain an interpretation of these orthogonal polynomials as a p-adic limit of polynomials associated to p-adic modular forms.     

Polynomials orthogonal on the semicircle,II

Generalizing previous work [2], we study complex polynomials {π _k },π _k (z)=z ^k +?, orthogonal with respect to a complex-valued inner product (f,g)=∫ ₀ ^π f(e ^iθ)g(e ^iθ)w(e ^iθ)dθ. Under suitable assumptions on the “weight function”w, we show that these polynomials exist whenever Re ∫ ₀ ^π w(e ^iθ)dθ≠0, and we express them in terms of the real polynomials orthogonal with respect to the weight functionw(x). We also obtain the basic three-term recurrence relation. A detailed study is made of the polynomials {π _k } in the case of the Jacobi weight functionw(z)=(1?z)^α(1+z)^β, α>?1, and its special case \(\alpha = \beta = \lambda - \tfrac{1}{2}\) (Gegenbauer weight). We show, in particular, that for Gegenbauer weights the zeros ofπ _n are all simple and, ifn≥2, contained in the interior of the upper unit half disc. We strongly suspect that the same holds true for arbitrary Jacobi weights. Finally, for the Gegenbauer weight, we obtain a linear second-order differential equation forπ _n (z). It has regular singular points atz=1, ?1, ∞ (like Gegenbauer's equation) and an additional regular singular point on the negative imaginary axis, which depends onn.     

Where does the sup norm of a weighted polynomial live?

A characterization is given of the sets supporting the uniform norms of weighted polynomials [w(x)] ⁿ P _n (x), whereP _n is any polynomial of degree at mostn. The (closed) support ∑ ofw(x) may be bounded or unbounded; of special interest is the case whenw(x) has a nonempty zero setZ. The treatment of weighted polynomials consists of associating each admissible weight with a certain functional defined on subsets of ∑ —Z. One main result of this paper states that there is a unique compact set (independent ofn andP _n ) maximizing this functional that contains the points where the norms of weighted polynomials are attained. The distribution of the zeros of Chebyshev polynomials corresponding to the weights [w(x)] ⁿ is also studied. The main theorems give a unified method of investigating many particular examples. Applications to weighted approximation on the real line with respect to a fixed weight are included.     

The expressive power of voting polynomials

We consider the problem of approximating a Boolean functionf∶{0,1} ⁿ →{0,1} by the sign of an integer polynomialp of degreek. For us, a polynomialp(x) predicts the value off(x) if, wheneverp(x)≥0,f(x)=1, and wheneverp(x)<0,f(x)=0. A low-degree polynomialp is a good approximator forf if it predictsf at almost all points. Given a positive integerk, and a Boolean functionf, we ask, “how good is the best degreek approximation tof?” We introduce a new lower bound technique which applies to any Boolean function. We show that the lower bound technique yields tight bounds in the casef is parity. Minsky and Papert [10] proved that a perceptron cannot compute parity; our bounds indicate exactly how well a perceptron canapproximate it. As a consequence, we are able to give the first correct proof that, for a random oracleA, PP ^A is properly contained in PSPACE ^A . We are also able to prove the old AC⁰ exponential-size lower bounds in a new way. This allows us to prove the new result that an AC⁰ circuit with one majority gate cannot approximate parity. Our proof depends only on basic properties of integer polynomials.