Some binomial formulas of the generalized Appell form (Q1856885): Difference between revisions

The formulas mentioned in the title are generating function relations of the form \[ \sum_{n\geq 0}u_n(z) f_n\bigl(f(t) \bigr)^n={fz(t) \over b(t)}, \tag{*} \] where \(f(t)=1+ f_1t+f_2 t^2+\cdots\), and \((u_n)\) is a Newton sequence of polynomials, i.e., there exists a sequence \(a_0,a_1,a_2, \dots\), such that \[ \begin{aligned} u_0(z) & =1,\\ u_n(z) & =(z-a_0) (z-a_1) \cdots(z-a_{n-1}) \quad \text{for }n\geq 1.\end{aligned} \] The authors' aim is to obtain all formulas of this kind; and in \S 1 they describe their approach as follows. ``We obtain from (*) a collection of necessary conditions that some of the initial coefficients of \(f,g,b\), and the initial terms of the sequence \(a_0,a_1,a_2, \dots\) must satisfy. We also find two linear homogeneous recurrence relations that the sequence of quotients \(f_n/f_{n+1}\) must satisfy. These recurrence relations have variable coefficients that depend on the initial coefficients of \(f\) and \(g\). We find conditions on such coefficients that are necessary for the existence of a nontrivial simultaneous solution of the recurrence relations. Combining all the necessary conditions, we obtain a finite list of sets of initial values that allow us to determine all the ingredients in (*). Finally, we verify the validity of the binomial formula obtained in each case.'' In carrying out this programme, the authors give detailed calculations to some extent. Other cases, however, had to be rather less completely dealt with, owing to the size of the expressions. In the treatment of the recurrencies, Maple plays a significant rôle. The final result is a list of fourteen relations of the form (*). There are a few misprints; thus \(S(k+1,k)\) should, as confirmed by the authors, read \(S(k+1,1)\) on p. 762 and in (4.2).