Abstract
ABSTRACTZeilberger's celebrated algorithm finds pure recurrence relations (w.r.t. a single variable) for hypergeometric sums automatically. However, in the theory of orthogonal polynomials and special functions, contiguous relations w.r.t. several variables exist in abundance. We modify Zeilberger's algorithm to generate unknown contiguous relations that are necessary to obtain inner bounds for the extreme zeros of orthogonal polynomial sequences with hypergeometric representations. Using this method, we improve previously obtained upper bounds for the smallest and lower bounds for the largest zeros of the Hahn polynomials and we identify inner bounds for the extreme zeros of the Continuous Hahn and Continuous Dual Hahn polynomials. Numerical examples are provided to illustrate the quality of the new bounds. Without the use of computer algebra such results are not accessible. We expect our algorithm to be useful to compute useful and new contiguous relations for other hypergeometric functions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.