Convolution polynomials

The polynomials that arise as coefficients when a power series is raised to the power x include many important special cases, which have surprising properties that are not widely known. This paper explains how to recognize and use such properties, and it closes with a general result about approximating such polynomials asymptotically.

[1]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1958 .

[2]  Charles Jordan.  On Stirling's Numbers , 1933 .

[3]  M. Kuczma.  Functional equations in a single variable , 1968 .

[4]  Gian-Carlo Rota,et al.  On the foundations of combinatorial theory III , 1969 .

[5]  I. Good.  Saddle-point Methods for the Multinomial Distribution , 1957 .

[6]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1959 .

[7]  L. Schoenfeld,et al.  The number of idempotent elements in symmetric semigroups , 1967 .

[8]  D. G. Rogers,et al.  Pascal triangles, Catalan numbers and renewal arrays , 1978, Discret. Math..

[9]  Mourad E. H. Ismail,et al.  A -umbral calculus , 1981 .

[10]  P. Erdös,et al.  On analytic iteration , 1960 .

[11]  Arthur Cayley,et al.  The Collected Mathematical Papers: On the analytical forms called trees , 1881 .

[12]  Adriano M. Garsia,et al.  An exposá of the mullin-rota theory of polynomials of binomial type , 1973 .

[13]  D. Knuth,et al.  A recurrence related to trees , 1989 .

[14]  J. F. Steffensen.  The poweroid, an extension of the mathematical notion of power , 1941 .

[15]  Donald E. Knuth.  Two notes on notation , 1992 .

[16]  M. Ward.  The Representation of Stirling's Numbers and Stirling's Polynomials as Sums of Factorials , 1934 .

[17]  Gian-Carlo Rota,et al.  On the foundations of combinatorial theory. VIII. Finite operator calculus , 1973 .

[18]  Theodore S. Motzkin,et al.  SORTING NUMBERS FOR CYLINDERS AND OTHER CLASSICATION NUMBER , 1971 .