首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Binomial Sums and Functions of Exponential Type
Authors:Mashreghi  Javad; Ransford  Thomas
Institution:Département de mathématiques et de statistique, Université Laval Québec (QC), Canada G1K 7P4; javad.mashreghi{at}mat.ulaval.ca, ransford{at}mat.ulaval.ca
Abstract:Let (an)n≥0 be a sequence of complex numbers, and, for n≥0, let Formula A number of results are proved relating the growth of the sequences(bn) and (cn) to that of (an). For example, given p≥0, if bn= O(np and Formula for all isin > 0,then an=0 for all n > p. Also, given 0 < p < 1, thenFormula for all isin > 0 if and onlyif Formula. It is further shown that, given rß > 1, if bn,cn=O(rßn), then an=O({alpha}n),where Formula, thereby proving a conjecture of Chalendar, Kellay and Ransford. The principal ingredientsof the proogs are a Phragmén-Lindelöf theorem forentire functions of exponential type zero, and an estimate forthe expected value of e{phi}(X), where X is a Poisson random variable.2000 Mathematics Subject Classification 05A10 (primary), 30D15,46H05, 60E15 (secondary).
Keywords:
本文献已被 Oxford 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号