On the zeros of subrange Jacobi polynomials

We introduce and study a geometric modification of the Douglas–Rachford method called the Circumcentered–Douglas–Rachford method. This method iterates by taking the intersection of bisectors of reflection steps for solving certain classes of feasibility problems. The convergence analysis is established for best approximation problems involving two (affine) subspaces and both our theoretical and numerical results compare favorably to the original Douglas–Rachford method. Under suitable conditions, it is shown that the linear rate of convergence of the Circumcentered–Douglas–Rachford method is at least the cosine of the Friedrichs angle between the (affine) subspaces, which is known to be the sharp rate for the Douglas–Rachford method. We also present a preliminary discussion on the Circumcentered–Douglas–Rachford method applied to the many set case and to examples featuring non-affine convex sets.     

On conjectured inequalities for zeros of Jacobi polynomials

Inequalities for the largest zero of Jacobi polynomials, conjectured recently by us and in joint work with P. Leopardi, are here extended to all zeros of Jacobi polynomials, and new relevant conjectures are formulated based on extensive computation.      

New conjectured inequalities for zeros of Jacobi polynomials

Inequalities recently conjectured for all zeros of Jacobi polynomials \(P_n^{(\alpha,\beta)}\) of all degrees n are modified and conjectured to hold (in reverse direction) in considerably larger domains of the (α,β)-plane.     

Interlacing of the zeros of Jacobi polynomials with different parameters

We prove results for the interlacing of zeros of Jacobi polynomials of the same or adjacent degree as one or both of the parameters are shifted continuously within a certain range. Numerical examples are given to illustrate situations where interlacing fails to occur.     

Harmonic divisors and rationality of zeros of Jacobi polynomials

Let $P_{n}^{ ( \alpha,\beta ) } ( x ) $ be the Jacobi polynomial of degree n with parameters α,β. The main result of the paper states the following: If b≠1,3 and c are non-zero relatively prime natural numbers then $P_{n}^{ ( k+ ( d-3 ) /2,k+ ( d-3 ) /2 ) } ( \sqrt{b/c} ) \neq0$ for all natural numbers d,n and $k\in\mathbb{N}_{0}$ . Moreover, under the above assumption, the polynomial $Q ( x ) = \frac{b}{c} ( x_{1}^{2}+\cdots+x_{d-1}^{2} ) + ( \frac{b}{c}-1 ) x_{d}^{2}$ is not a harmonic divisor, and the Dirichlet problem for the cone {Q(x)<0} has polynomial harmonic solutions for polynomial data functions.     

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.     

Conjectured inequalities for Jacobi polynomials and their largest zeros

Inequalities are conjectured for the Jacobi polynomials and their largest zeros. Special attention is given to the cases β = α − 1 and β = α.      

On the zeros of Meixner polynomials

We investigate the zeros of a family of hypergeometric polynomials $M_n(x;\beta ,c)=(\beta )_n\,{}_2F_1(-n,-x;\beta ;1-\frac{1}{c})$ , $n\in \mathbb N ,$ known as Meixner polynomials, that are orthogonal on $(0,\infty )$ with respect to a discrete measure for $\beta >0$ and $0<c<1.$ When $\beta =-N$ , $N\in \mathbb N $ and $c=\frac{p}{p-1}$ , the polynomials $K_n(x;p,N)=(-N)_n\,{}_2F_1(-n,-x;-N;\frac{1}{p})$ , $n=0,1,\ldots , N$ , $0<p<1$ are referred to as Krawtchouk polynomials. We prove results for the zero location of the orthogonal polynomials $M_n(x;\beta ,c)$ , $c<0$ and $n<1-\beta $ , the quasi-orthogonal polynomials $M_n(x;\beta ,c)$ , $-k<\beta <-k+1$ , $k=1,\ldots ,n-1$ and $0<c<1$ or $c>1,$ as well as the polynomials $K_{n}(x;p,N)$ with non-Hermitian orthogonality for $0<p<1$ and $n=N+1,N+2,\ldots $ . We also show that the polynomials $M_n(x;\beta ,c)$ , $\beta \in \mathbb R $ are real-rooted when $c\rightarrow 0$ .     

On the zeros of exponential polynomials

Suppose r = (r₁, …, r_M), r_j ? 0, γ_kj ? 0 integers, k = 1, 2, …, N, j = 1, 2, …, M, γ_k · r = ∑_jγ_kjr_j. The purpose of this paper is to study the behavior of the zeros of the function h(λ, a, r) = 1 + ∑_{j = 1}^Na_je^{?λγ_j · r}, where each a_j is a nonzero real number. More specifically, if $\text{Z}\text{?}\text{(a, r) =}\text{closure}\text{{}\text{Re}\text{λ: h(λ, a, r) = 0}}$, we study the dependence of $\text{Z}\text{?}\text{(a, r)}\text{on}\text{a, r}$. This set is continuous in a but generally not in r. However, it is continuous in r if the components of r are rationally independent. Specific criterion to determine when $\text{0 ?}\text{Z}\text{?}\text{(a, r)}$ are given. Several examples illustrate the complicated nature of $\text{Z}\text{?}\text{(a, r)}$. The results have immediate implication to the theory of stability for difference equations x(t) ? ∑_{k = 1}^MA_kx(t ? r_k) = 0, where x is an n-vector, since the characteristic equation has the form given by h(λ, a, r). The results give information about the preservation of stability with respect to variations in the delays. The results also are fundamental for a discussion of the dependence of solutions of neutral differential difference equations on the delays. These implications will appear elsewhere.     

On the zeros of certain polynomials

We prove that certain naturally arising polynomials have all of their roots on a vertical line.     

On the zeros of certain self-reciprocal polynomials

We investigate the distribution of zeros around the unit circle of real self-reciprocal polynomials of even degrees with five terms whose absolute values of middle coefficients equal the sum of all other coefficients. Furthermore, it also give a new inequality and other Eneström-Kakeya types of results as by-products of this investigation.     

On zeros of discrete orthogonal polynomials

We exploit difference equations to establish sharp inequalities on the extreme zeros of the classical discrete orthogonal polynomials, Charlier, Krawtchouk, Meixner and Hahn. We also provide lower bounds on the minimal distance between their consecutive zeros.     

On linearization coefficients of Jacobi polynomials

This article deals with the problem of finding closed analytical formulae for generalized linearization coefficients for Jacobi polynomials. By considering some special cases, we obtain a reduction formula using for this purpose symbolic computation, in particular Zeilberger’s and Petkovsek’s algorithms.     

On the distribution of simple zeros of polynomials

Erd s and Turán discussed in (Ann. of Math. 41 (1940), 162–173; 51 (1950), 105–119) the distribution of the zeros of monic polynomials if their Chebyshev norm on [−1, 1] or on the unit disk is known. We sharpen this result to the case that all zeros of the polynomials are simple. As applications, estimates for the distribution of the zeros of orthogonal polynomials and the distribution of the alternation points in Chebyshev polynomial approximation are given. This last result sharpens a well-known error bound of Kadec (Amer. Math. Soc. Transl. 26 (1963), 231–234).     

On permanents and the zeros of rook polynomials

The concept of rook polynomial of a “chessboard” may be generalized to the rook polynomial of an arbitrary rectangular matrix. A conjecture that the rook polynomials of “chessboards” have only real zeros is thus carried over to the rook polynomials of nonnegative matrices. This paper proves these conjectures, and establishes interlacing properties for the zeros of the rook polynomials of a positive matrix and the matrix obtained by striking any one row or any one column.     

On Jacobi and continuous Hahn polynomials

Jacobi polynomials are mapped onto the continuous Hahn polynomials by the Fourier transform, and the orthogonality relations for the continuous Hahn polynomials then follow from the orthogonality relations for the Jacobi polynomials and the Parseval formula. In a special case this relation dates back to work by Bateman in 1933 and we follow a part of the historical development for these polynomials. Some applications of this relation are given.

     

On the zeros of complex Van Vleck polynomials

Polynomial solutions to the generalized Lamé equation, the Stieltjes polynomials, and the associated Van Vleck polynomials, have been studied extensively in the case of real number parameters. In the complex case, relatively little is known. Numerical investigations of the location of the zeros of the Stieltjes and Van Vleck polynomials in special cases reveal intriguing patterns in the complex case, suggestive of a deeper structure. In this article we report on these investigations, with the main result being a proof of a theorem confirming that the zeros of the Van Vleck polynomials lie on special line segments in the case of the complex generalized Lamé equation having three free parameters. Furthermore, as a result of this proposition, we are able to obtain in this case a strengthening of a classical result of Heine on the number of possible Van Vleck polynomials associated with a given Stieltjes polynomial.