Zeros of Gegenbauer and Hermite polynomials and connection coefficients

In this paper, sharp upper limit for the zeros of the ultraspherical polynomials are obtained via a result of Obrechkoff and certain explicit connection coefficients for these polynomials. As a consequence, sharp bounds for the zeros of the Hermite polynomials are obtained.

     

Bounds and Majorization Relations for the Zeros of a Class of Fibonacci-Type Polynomials

We apply certain matrix inequalities involving eigenvalues, the numerical radius, and the spectral radius to obtain new bounds and majorization relations for the zeros of a class of Fibonacci-type polynomials. Our results improve upon some earlier bounds for the zeros of these polynomials.     

Improvement of the formal and numerical estimation of the constant in some Markov-Bernstein inequalities

Some methods of numerical analysis, used for obtaining estimations of zeros of polynomials, are studied again, more especially in the case where the zeros of these polynomials are all strictly positive, distinct and real. They give, in particular, formal lower and upper bounds for the smallest zero. Thanks to them, we produce new formal lower and upper bounds of the constant in Markov-Bernstein inequalities in L ² for the norm corresponding to the Laguerre and Gegenbauer inner products. In fact, since this constant is the inverse of the square root of the smallest zero of a polynomial, we give formal lower and upper bounds of this zero. Moreover, a new sufficient condition is given in order that a polynomial has some complex zeros. This revised version was published online in June 2006 with corrections to the Cover Date.     

Bounds and a majorization for the real parts of the zeros of polynomials

We apply some eigenvalue inequalities to the real parts of the Frobenius companion matrices of monic polynomials to establish new bounds and a majorization for the real parts of the zeros of these polynomials.

     

Robust Bounds for Krylov Methods

In this paper we give bounds for polynomials of operators. These bounds are robust in low rank perturbations. This problem is encountered in the study of the convergence of Krylov methods. The central idea here is to view the resolvent as a meromorphic function.     

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.     

关于矩阵多项式特征值界的注记

本文讨论矩阵多项式特征值定域问题.首先对Higham和Tisseur[Linear Algebra Appl.,358(2003),5-22]得到的结果给出较详细的比较.然后利用分块矩阵谱半径的估计给出了获取特征值界的一种新办法.利用这种新办法,不但可以简明地得出很多已有的界,且对椭圆及双曲矩阵多项式得出了特征值的新的界.     

Polynomials associated with a functional product of the Hermite type

We have found the motivation for this paper in the research of a quantized closed Friedmann cosmological model. There, the second‐order linear ordinary differential equation emerges as a wave equation for the physical state functions. Studying the polynomial solutions of this equation, we define a new functional product in the space of real polynomials. This product includes the indexed weight functions which depend on the degrees of participating polynomials. Although it does not have all of the properties of an inner product, a unique sequence of polynomials can be associated with it by an additional condition. In the special case presented here, we consider the Hermite‐type weight functions and prove that the associated polynomial sequence can be expressed in the closed form via the Hermite polynomials. Also, we find their Rodrigues‐type formula and a four‐term recurrence relation. In contrast to the zeros of Hermite polynomials, which are symmetrically located with respect to the origin, the zeros of the new polynomial sequence are all positive. Copyright © 2015 John Wiley & Sons, Ltd.     

Asymptotics and Zeros of Sobolev Orthogonal Polynomials on Unbounded Supports

In this paper we present a survey about analytic properties of polynomials orthogonal with respect to a weighted Sobolev inner product such that the vector of measures has an unbounded support. In particular, we focus on the asymptotic behaviour of such polynomials as well as in the distribution of their zeros. Some open problems as well as some directions for future research are formulated.Research of Juan José Moreno Balcázar was partially supported by Ministerio de Educación y Ciencia of Spain under grant MTM2005-08648-C02-01 and Junta de Andalucía (FQM 229 and FQM 481).     

Estimates for the real and imaginary parts of the eigenvalues of matrices and applications

This paper is a continuation of our recent work on the localization of the eigenvalues of matrices. We give new bounds for the real and imaginary parts of the eigenvalues of matrices. Applications to the localization of the zeros of polynomials are also given.     

On the log-convexity of combinatorial sequences

We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials, matching polynomials, Narayana polynomials and Eulerian polynomials. We also settle certain conjectures of Stahl on genus polynomials by proving them for certain classes of graphs, while showing that they are false in general.     

Extremal polynomials for obtaining bounds for spherical codes and designs

We investigate two extremal problems for polynomials giving upper bounds for spherical codes and for polynomials giving lower bounds for spherical designs, respectively. We consider two basic properties of the solutions of these problems. Namely, we estimate from below the number of double zeros and find zero Gegenbauer coefficients of extremal polynomials. Our results allow us to search effectively for such solutions using a computer. The best polynomials we have obtained give substantial improvements in some cases on the previously known bounds for spherical codes and designs. Some examples are given in Section 6. This research was partially supported by the Bulgarian NSF under Contract I-35/1994.     

Bounds on the coefficients of tension and flow polynomials

The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we use the fact that these polynomials can be realized as Ehrhart polynomials of inside-out polytopes. Inside-out polytopes come with an associated relative polytopal complex and, for a wide class of inside-out polytopes, we show that this complex has a convex ear decomposition. This leads to the desired bounds on the coefficients of these polynomials.     

Asymptotics of orthogonal polynomials and the numerical solution of ill-posed problems

The paper reviews the impact of modern orthogonal polynomial theory on the analysis of numerical algorithms for ill-posed problems. Of major importance are uniform bounds for orthogonal polynomials on the support of the weight function, the growth of the extremal zeros, and asymptotics of the Christoffel functions.     

A generalization of the Gauss-Lucas theorem

Given a set of points in the complex plane, an incomplete polynomial is defined as the one which has these points as zeros except one of them. The classical result known as Gauss-Lucas theorem on the location of zeros of polynomials and their derivatives is extended to convex linear combinations of incomplete polynomials. An integral representation of convex linear combinations of incomplete polynomials is also given.     

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.     

Bounds on degrees of p-adic separating polynomials

We study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Štefankovi? (2001), which provides bounds on degrees of polynomials with p-adically controlled behavior. Such polynomials are of particular interest because they furnish bounds on the size of set systems satisfying Frankl-Wilson-type conditions modulo prime powers, with lower degree polynomials providing better bounds. We elucidate the asymptotic structure of solutions to the optimization problem, and we also provide an improved method for finding solutions in certain circumstances.     

Intractability Results for Positive Quadrature Formulas and Extremal Problems for Trigonometric Polynomials

Lower bounds for the error of quadrature formulas with positive weights are proved. We get intractability results for quasi-Monte Carlo methods and, more generally, for positive formulas. We consider general classes of functions but concentrate on lower bounds for relatively small classes of trigonometric polynomials. We also conjecture that similar lower bounds hold for arbitrary quadrature formulas and state different equivalent conjectures concerning positive definiteness of certain matrices and certain extremal problems for trigonometric polynomials. We also study classes of functions with weighted norms where some variables are “more important” than others. Positive quadrature formulas are then tractable iff the sum of the weights is bounded.     

Exact point-distributions over the complex sphere

We study point-distributions over the surface of the unit sphere in unitary space that generate quadrature rules which are exact for spherical polynomials up to a certain bi-degree. In this first stage, we explore several different characterizations for this type of point sets using standard tools such as, positive definiteness, reproducing kernel techniques, linearization formulas, etc. We find bounds on the cardinality of a point-distribution, without discussing the deeper question regarding best bounds. We include examples, construction methods and explain, via isometric embeddings from real to complex spheres, the proper connections with the so-called spherical designs.