The higher production matrix formula for Riordan arrays

At least 5 years old · documented by

Let M=(g(x),f(x))M=(g(x),f(x)) be a Riordan array, and let PM(n)P^{(n)}_M denote its nn-th production matrix, defined by

PM(n)=∣(n−1)M−1M‾(n).P^{(n)}_M=|^{(n-1)}M^{-1}\overline{M}^{(n)}.

Let M(n)M^{(n)} be the matrix produced by PM(n)P^{(n)}_M. Higher production matrix conjecture. For every positive integer nn,

M(n)=((xf(x))n−1,x(xf(x))n−1)−1⋅(g(x),f(x)).M^{(n)}=\left(\left(\frac{x}{f(x)}\right)^{n-1},x\left(\frac{x}{f(x)}\right)^{n-1}\right)^{-1}\cdot(g(x),f(x)).

This generalizes the preceding formulas for the second and third production matrices of a Riordan array. The source presents the formula as a conjecture, and no resolution is supplied in the cited text.

References

Primary source

Paul Barry, “The second production matrix of a Riordan array”, arXiv:2011.13985 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.