Varying weights for orthogonal polynomials with monotonically varying recurrence coefficients

We consider orthogonal polynomials , where n is the degree of the polynomial and N is a discrete parameter. These polynomials are orthogonal with respect to a varying weight W_N which depends on the parameter N and they satisfy a recurrence relation with varying recurrence coefficients which we assume to be varying monotonically as N tends to infinity. We establish the existence of the limit and link this limit to an external field for an equilibrium problem in logarithmic potential theory.     

The asymptotic behaviour of recurrence coefficients for orthogonal polynomials with varying exponential weights

We consider orthogonal polynomials on the real line with respect to a weight and in particular the asymptotic behaviour of the coefficients a_n,N and b_n,N in the three-term recurrence xπ_n,N(x)=π_n+1,N(x)+b_n,Nπ_n,N(x)+a_n,Nπ_n−1,N(x). For one-cut regular V we show, using the Deift-Zhou method of steepest descent for Riemann-Hilbert problems, that the diagonal recurrence coefficients a_n,n and b_n,n have asymptotic expansions as n→∞ in powers of 1/n² and powers of 1/n, respectively.     

Reducibility of translates of Dickson polynomials

Let be a field and . The Dickson polynomial is characterized by the equation . We prove that is reducible if and only if there is a prime such that for some , or and for some . This result generalizes the well-known reducibility criterion for binomials; and it provides a reducibility criterion for where denotes the Chebyshev polynomial of degree .

     

Reducibility of lacunary polynomials,VII

Letk>1 and let be non-zero algebraic numbers contained in the field . It is shown that for almost all, in the sense of density integer vectorsn ₁,...,n _k the polynomial becomes irreducible over on dividing by the product of all factorsx–, where is a root of unity.Dedicated to Professor E. Hlawka on the occasion of his seventieth birthday     

Reducibility of matrix polynomials and their traces

Résumé Pour des variables matriciellesn x n, nous démontrons la réductibilité en degré de certains produits et de leurs traces, afin de généraliser au delà des dimensions 2 ou 3 quelques résultats employés parRivlin, Smith etSpencer, pour extraire une base d'intégrité orthogonale des tenseurs symétriques. En particulier, pourn3, nous démontrons la réductibilité en degré de tout produit de 2 ⁿ –1 matrices et de la trace de tel produit.

---

---

The work described in this paper was carried out under Contract No. 562 (40).     

Small polynomials with integer coefficients

We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials. Their factors, zero distribution and asymptotics are the main subjects of this paper. In particular, we show that the integer Chebyshev polynomials for any infinite subset of the real line must have infinitely many distinct factors, which answers a question of Borwein and Erdélyi. Furthermore, it is proved that the accumulation set for their zeros must be of positive capacity in this case. We also find the first nontrivial examples of explicit integer Chebyshev constants for certain classes of lemniscates. Since it is rarely possible to obtain an exact value of the integer Chebyshev constant, good estimates are of special importance. Introducing the methods of weighted potential theory, we generalize and improve the Hilbert-Fekete upper bound for the integer Chebyshev constant. These methods also give bounds for the multiplicities of factors of integer Chebyshev polynomials, and lower bounds for the integer Chebyshev constant. Moreover, all the bounds mentioned can be found numerically by using various extremal point techniques, such as the weighted Leja points algorithm. Applying our results in the classical case of the segment [0, 1], we improve the known bounds for the integer Chebyshev constant and the multiplicities of factors of the integer Chebyshev polynomials. Research supported in part by the National Security Agency under Grant No. MDA904-03-1-0081.     

Inequalities for polynomials with restricted coefficients

We obtain other refinements of the inequalities of S. N. Bernstein and M. Riesz for polynomials. The methods of proof use the theory of boundpreserving convolution operators in the unit disk and interpolation formulas.     

On algebraic polynomials with random coefficients

The expected number of real zeros and maxima of the curve representing algebraic polynomial of the form

where , are independent standard normal random variables, are known. In this paper we provide the asymptotic value for the expected number of maxima which occur below a given level. We also show that most of the zero crossings of the curve representing the polynomial are perpendicular to the axis. The results show a significant difference in mathematical behaviour between our polynomial and the random algebraic polynomial of the form which was previously the most studied.

     

Approximation by polynomials with small coefficients

Translated from Matematicheskie Zametki, Vol. 57, No. 1, pp. 150–153, January, 1995.     

Algebraic polynomials with non-identical random coefficients

There are many known asymptotic estimates for the expected number of real zeros of a random algebraic polynomial The coefficients are mostly assumed to be independent identical normal random variables with mean zero and variance unity. In this case, for all sufficiently large, the above expected value is shown to be . Also, it is known that if the have non-identical variance , then the expected number of real zeros increases to . It is, therefore, natural to assume that for other classes of distributions of the coefficients in which the variance of the coefficients is picked at the middle term, we would also expect a greater number of zeros than . In this work for two different choices of variance for the coefficients we show that this is not the case. Although we show asymptotically that there is some increase in the number of real zeros, they still remain . In fact, so far the case of is the only case that can significantly increase the expected number of real zeros.

     

Approximation by polynomials with bounded coefficients

Let θ be a real number satisfying 1<θ<2, and let A(θ) be the set of polynomials with coefficients in {0,1}, evaluated at θ. Using a result of Bugeaud, we prove by elementary methods that θ is a Pisot number when the set (A(θ)−A(θ)−A(θ)) is discrete; the problem whether Pisot numbers are the only numbers θ such that 0 is not a limit point of (A(θ)−A(θ)) is still unsolved. We also determine the three greatest limit points of the quantities , where C(θ) is the set of polynomials with coefficients in {−1,1}, evaluated at θ, and we find in particular infinitely many Perron numbers θ such that the sets C(θ) are discrete.     

On the limit behavior of recurrence coefficients for multiple orthogonal polynomials

In this paper we investigate general properties of the coefficients in the recurrence relation satisfied by multiple orthogonal polynomials. The results include as particular cases Angelesco and Nikishin systems.     

Reducibility of a system of linear differential equations with quasiperiodic coefficients

Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 41, No. 12, pp.1669–1680, December, 1989.     

Reducibility of linear systems of difference equations with almost periodic coefficients

We establish sufficient conditions of the reducibility of the linear system of difference equationsx(t+1)=Ax(t) + P(t) x(t) with an almost periodic matrixP(t) to a system with a constant matrix.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 12, pp. 1661–1667, December, 1993.     

On roots of polynomials with positive coefficients

We prove that an algebraic number α is a root of a polynomial with positive rational coefficients if and only if none of its conjugates is a nonnegative real number. This settles a recent conjecture of Kuba.     

Reducibility of linear differential equations in a Banach space with quasiperiodic coefficients

Ukrainian Mathematical Journal -