Conjecture on the row sum polynomials of the production matrix of an almost Riordan array

Let Pn(x)P_n(x) denote the row sum polynomials of the matrix generated by regarding A\overline{A} as a production matrix. The initial polynomials are

1,2x,x23x+3,x3+5x28x+5,x48x3+22x225x+11,.1,\quad 2-x,\quad x^2-3x+3,\quad -x^3+5x^2-8x+5,\quad x^4-8x^3+22x^2-25x+11,\ldots.

Row sum polynomial conjecture. For every n0n\geq 0,

Pn(x)=1+(1x)i=0n1(1x)i.P_n(x)=1+(1-x)\sum_{i=0}^{n-1}(1-x)_i.

Here (1x)i(1-x)_i denotes the falling factorial (1x)(x)(2xi)(1-x)(-x)\cdots(2-x-i), with the empty sum interpreted as 00 when n=0n=0. This conjecture gives a closed formula for the row sums of the production matrix and extends the observed initial values; its resolution is not indicated in the supplied text.

Sources & referencesView supporting material

Primary source

Paul Barry, “On the partial sums of Riordan arrays”, arXiv:2108.13537 (2021).

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.