Bounds for extreme zeros of Meixner-Pollaczek polynomials

Abstract

In this paper we consider connection formulae for orthogonal polynomials in the context of Christoffel transformations for the case where a weight function, not necessarily even, is multiplied by an even function c2k(x),k∈ N0, to determine new lower bounds for the largest zero and upper bounds for the smallest zero of a Meixner-Pollaczek polynomial. When pn is orthogonal with respect to a weight w(x) and gn-m is orthogonal with respect to the weight c2k(x)w(x), we show that k∈\0,1,…,m\ is a necessary and sufficient condition for existence of a connection formula involving a polynomial Gm-1 of degree (m-1), such that the (n-1) zeros of Gm-1gn-m and the n zeros of pn interlace. We analyse the new inner bounds for the extreme zeros of Meixner-Pollaczek polynomials to determine which bounds are the sharpest. We also briefly discuss bounds for the zeros of Pseudo-Jacobi polynomials.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…