Recursively defined combinatorial functions: Extending Galton's board (Q5946746): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(00)00373-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1983452260 / rank | |||
Normal rank |
Latest revision as of 08:54, 30 July 2024
scientific article; zbMATH DE number 1659493
Language | Label | Description | Also known as |
---|---|---|---|
English | Recursively defined combinatorial functions: Extending Galton's board |
scientific article; zbMATH DE number 1659493 |
Statements
Recursively defined combinatorial functions: Extending Galton's board (English)
0 references
2 October 2002
0 references
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.
0 references
bivariate recurrence
0 references
matrix inversion
0 references
binomial coefficients
0 references
Stirling numbers
0 references
Lah numbers
0 references
Euler numbers
0 references
Gaussian coefficients
0 references