Recursively defined combinatorial functions: Extending Galton's board (Q5946746)

The author studies matrices \(\big(F(n,k)\big)_{n,k\geq 0}\), where the entries satisfy the recurrence \[ F(n,k)=a_{n-1,k}F(n-1,k)+b_{n-1,k-1}F(n-1,k-1). \] Under certain initial conditions he calls such arrays Galton arrays. His main focus is what the result of the multiplication of two such ``Galton arrays'' \(\big(F(n,k)\big)\) and \(\big(G(n,k)\big)\) is, and whether it is again a ``Galton array.'' The main result is a multiplication theorem for such Galton arrays, which allows also to derive, as a corollary, a theorem about the inversion of (certain) Galton arrays.