THE RIEMANN–HILBERT APPROACH TO GLOBAL ASYMPTOTICS OF DISCRETE ORTHOGONAL POLYNOMIALS WITH INFINITE NODES

Author:

OU CHUNHUA1,WONG R.2

Affiliation:

1. Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Canada, A1C 5S7, Canada

2. Liu Bie Ju Centre for Mathematical Sciences, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong

Abstract

In this paper, we develop the Riemann–Hilbert approach to study the global asymptotics of discrete orthogonal polynomials with infinite nodes. We illustrate our method by concentrating on the Charlier polynomials [Formula: see text]. We first construct a Riemann–Hilbert problem Y associated with these polynomials and then establish some technical results to transform Y into a continuous Riemann–Hilbert problem so that the steepest descent method of Deift and Zhou ([8]) can be applied. Finally, we produce three Airy-type asymptotic expansions for [Formula: see text] in three different but overlapping regions whose union is the entire complex z-plane. When z is real, our results agree with the ones given in the literature. Although our approach is similar to that used by Baik, Kriecherbauer, McLaughlin and Miller ([3]), there are crucial differences in the details. For instance, our expansions hold in much bigger regions. Our results are completely new, and one of them answers a question raised in Bo and Wong ([4]). Asymptotic formulas are also derived for large and small zeros of the Charlier polynomials.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Analysis

Reference26 articles.

Cited by 17 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3