SearcharxivSearch

arXiv subjects

Kathy Driver

Publications and source records attributed to Kathy Driver.

4 recordsLinked to original sources

Orthogonal sequences constructed from quasi-orthogonal ultraspherical polynomials

Let $\displaystyle \{x_{k,n-1}\} _{k=1}^{n-1}$ and $\displaystyle \{x_{k,n}\} _{k=1}^{n},$ $n \in \mathbb{N}$, be two sets of real, distinct points satisfying the interlacing property $ x_{i,n} -3/2$, $\lambda \neq -1,0, (2k-1)/2, k=0,1,\ldots$. We plot and compare the zeros of $D_m^{\lambda} (x)$ and $C_m^{\lambda} (x)$ for several choices of $m \in \mathbb{N}$ and a range of values of the parameters $\lambda$ and $n$. For $-3/2 < \lambda < -1,$ the curves that the zeros of $D_m^{\lambda} (x)$ and $C_m^{\lambda} (x)$ approach are substantially different for large values of $m.$ When $-1 < \lambda < -1/2,$ the two curves have a similar shape while the curves are almost identical for $\lambda >-1/2.$

math.CA

Bounds for Extreme Zeros of Quasi-orthogonal Ultraspherical Polynomials

We discuss and compare upper and lower bounds obtained by two different methods for the positive zero of the ultraspherical polynomial $C_{n}^{(\lambda)}$ that is greater than $1$ when $-3/2 < \lambda < -1/2.$ Our first approach uses mixed three term recurrence relations and interlacing of zeros while the second approach uses a method going back to Euler and Rayleigh and already applied to Bessel functions and Laguerre and $q$-Laguerre polynomials. We use the bounds obtained by the second method to simplify the proof of the interlacing of the zeros of $(1-x^2)C_{n}^{(\lambda)}$ and $C_{n+1}^{(\lambda)}$, for $-3/2 < \lambda < \infty$.

math.CA

Zeros of Quasi-Orthogonal Jacobi Polynomials

We consider interlacing properties satisfied by the zeros of Jacobi polynomials in quasi-orthogonal sequences characterised by $\alpha>-1$, $-2<\beta<-1$. We give necessary and sufficient conditions under which a conjecture by Askey, that the zeros of Jacobi polynomials $P_n^{(\alpha, \beta)}$ and $P_{n}^{(\alpha,\beta+2)}$ are interlacing, holds when the parameters $\alpha$ and $\beta$ are in the range $\alpha>-1$ and $-2<\beta<-1$. We prove that the zeros of $P_n^{(\alpha, \beta)}$ and $P_{n+1}^{(\alpha,\beta)}$ do not interlace for any $n\in\mathbb{N}$, $n\geq2$ and any fixed $\alpha$, $\beta$ with $\alpha>-1$, $-2<\beta<-1$. The interlacing of zeros of $P_n^{(\alpha,\beta)}$ and $P_m^{(\alpha,\beta+t)}$ for $m,n\in\mathbb{N}$ is discussed for $\alpha$ and $\beta$ in this range, $t\geq 1$, and new upper and lower bounds are derived for the zero of $P_n^{(\alpha,\beta)}$ that is less than $-1$.

math.CA

Polynomial solutions of differential-difference equations

We investigate the zeros of polynomial solutions to the differential-difference equation \[ P_{n+1}(x)=A_{n}(x)P_{n}^{\prime}(x)+B_{n}(x)P_{n}(x), n=0,1,... \] where $A_{n}$ and $B_{n}$ are polynomials of degree at most 2 and 1 respectively. We address the question of when the zeros are real and simple and whether the zeros of polynomials of adjacent degree are interlacing. Our result holds for general classes of polynomials but includes sequences of classical orthogonal polynomials as well as Euler-Frobenius, Bell and other polynomials.

math.CA