ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.