加载中…
We investigate polynomial sets {P n } n0 with generating power series of the form F (xt – R(t)) and satisfying, for n 0, the (d + 1)-order recursion xP_ n (x) = P_{ n+1 }(x) +\sum_{ l=0}^{d} \gamma^{l}_{n} P_{ n–l} (x), where \ {\gamma ^{l}_{ n}\ } is a complex sequence for 0 l d, P _0 (x) = 1 and P _n (x) = 0 for all negative integer n. We show that the formal power series R(t) is a polynomial of degree at most d + 1 if certain coefficients of R(t) are null or if F (t) is a generalized hypergeometric series. Moreover, for the d-symmetric case we demonstrate that R(t) is the monomial of degree d + 1 and F (t) is expressed by hypergeometric series.

生成讲解博客的中文版本

生成AI智能校验的中文版本