Reciprocal polynomials with all zeros on the unit circle

Let f(x)=a _d x ^d +a _d−1 x ^d−1+⋅⋅⋅+a ₀∈ℝ[x] be a reciprocal polynomial of degree d. We prove that if the coefficient vector (a _d ,a _d−1,…,a ₀) or (a _d−1,a _d−2,…,a ₁) is close enough, in the l ¹-distance, to the constant vector (b,b,…,b)∈ℝ ^d+1 or ℝ ^d−1, then all of its zeros have moduli 1.     

Reciprocal polynomials with all but two zeros on the unit circle

We derive sufficient conditions under which all but two zeros of reciprocal polynomials lie on the unit circle, and specify the location of the remaining two zeros.     

Sums of two polynomials with each having real zeros symmetric with the other

Consider the polynomial equation

Quadrature formula and zeros of para-orthogonal polynomials on the unit circle

Given a probability measure μ on the unit circle T, we study para-orthogonal polynomials B_n(^.,w) (with fixed w ∈ T) and their zeros which are known to lie on the unit circle. We focus on the properties of zeros akin to the well known properties of zeros of orthogonal polynomials on the real line, such as alternation, separation and asymptotic distribution. We also estimate the distance between the consecutive zeros and examine the property of the support of μ to attract zeros of para-orthogonal polynomials. This revised version was published online in June 2006 with corrections to the Cover Date.     

Number of zeros of interval polynomials

In this paper, we develop a rigorous algorithm for counting the real interval zeros of polynomials with perturbed coefficients that lie within a given interval, without computing the roots of any polynomials. The result generalizes Sturm’s Theorem for counting the roots of univariate polynomials to univariate interval polynomials.     

Some results on zeros and uniqueness of difference-differential polynomials

We consider the zeros distributions of difference-differential polynomials which are the derivatives of difference products of entire functions.We also investigate the uniqueness problems of difference...     

Rank one perturbations and the zeros of paraorthogonal polynomials on the unit circle

We prove several results about zeros of paraorthogonal polynomials using the theory of rank one perturbations of unitary operators. In particular, we obtain new details on the interlacing of zeros for successive POPUC.     

The statistical distribution of the zeros of random paraorthogonal polynomials on the unit circle

The orthogonal polynomials on the unit circle are defined by the recurrence relation

where for any k0. If we consider n complex numbers and , we can use the previous recurrence relation to define the monic polynomials Φ₀,Φ₁,…,Φ_n. The polynomial Φ_n(z)=Φ_n(z;α₀,…,α_n-2,α_n-1) obtained in this way is called the paraorthogonal polynomial associated to the coefficients α₀,α₁,…,α_n-1.We take α₀,α₁,…,α_n-2 i.i.d. random variables distributed uniformly in a disk of radius r<1 and α_n-1 another random variable independent of the previous ones and distributed uniformly on the unit circle. For any n we will consider the random paraorthogonal polynomial Φ_n(z)=Φ_n(z;α₀,…,α_n-2,α_n-1). The zeros of Φ_n are n random points on the unit circle.We prove that for any the distribution of the zeros of Φ_n in intervals of size near e^iθ is the same as the distribution of n independent random points uniformly distributed on the unit circle (i.e., Poisson). This means that, for large n, there is no local correlation between the zeros of the considered random paraorthogonal polynomials.     

On zeros of polynomials orthogonal with respect to a quasi-definite inner product on the unit circle

In this paper we present some results concerning the zeros of sequences of polynomials orthogonal with respect to a quasi-definite inner product on the unit circle. We study zero general properties, the existence of sequences with prefixed zeros and some situations concerning the polynomials with multiple zeros.     

On polynomials of best approximation

In the space of continuous functions defined on the ball from ?ⁿ, n ≥ 2, we study the set of algebraic polynomials of least deviation from zero. Its width and dimension are estimated.     

Extremal properties of certain trigonometric functions and Chebyshev polynomials

For a wide class of symmetric trigonometric polynomials, the minimal deviation property is established. As a corollary, the extremal property is proved for the components of the Chebyshev polynomial mappings corresponding to symmetric algebras A _α.     

Polynomials with all zeros on the unit circle

We give a new suffcient condition for all zeros of self-inversive polynomials to be on the unit circle, and find the location of zeros. This generalizes some recent results of Lakatos [7], Schinzel [17], Lakatos and Losonczi [9], [10]. By this suffcient condition the mentioned results can be treated in a unified way.     

Eigenvalue estimates for non-normal matrices and the zeros of random orthogonal polynomials on the unit circle

We prove that for any n×n matrix, A, and z with |z|A, we have that . We apply this result to the study of random orthogonal polynomials on the unit circle.     

The zeros of Faber polynomials generated by an -star

It is shown that the zeros of the Faber polynomials generated by a regular -star are located on the -star. This proves a recent conjecture of J. Bartolomeo and M. He. The proof uses the connection between zeros of Faber polynomials and Chebyshev quadrature formulas.

     

Orthogonal polynomials on the unit circle associated with the Laguerre polynomials

Using the well-known fact that the Fourier transform is unitary, we obtain a class of orthogonal polynomials on the unit circle from the Fourier transform of the Laguerre polynomials (with suitable weights attached). Some related extremal problems which arise naturally in this setting are investigated.

     

On the zeros of polynomials

In this paper we extend a classical result due to Cauchy and its improvement due to Datt and Govil to a class of lacunary type polynomials.     

Identification of non-optimal arcs for the travelling salesman problem

Conditions are presented for the identification of (directed) arcs for the traveling salesman problem, that can be eliminated with at least one optimal solution remaining. The conditions are not based on lower or upper bounds; the presence of an identified arc in a solution implies that the solution is not 3-optimal. An example illustrates how to use the conditions.     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.