A008288 → basis A013609 → D

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
   1:     0;
   2:     2;
   3:    10,      8;
   4:    36,     64,     24;
   5:   116,    320,    264,     64;
   6:   350,   1312,   1704,    896,     160;
   7:  1014,   4808,   8568,   7104,    2720,    384;
   8:  2856,  16384,  37200,  42496,   25600,   7680,    896;
   9:  7880,  53056, 146544, 214144,  177920,  83712,  20608,  2048;
  10: 21402, 165440, 538608, 960768, 1023040, 663552, 255360, 53248, 4608;

The row polynomials satisfy (n-2+(n^2-3*n+2)*x-(n-2)*x^2)*P(n,x) = -(2*n^2-13*n+16+(3*n^2-27*n+40)*x-(9*n-24)*x^2+4*x^3)*P(n-1,x) + (2*n-4+(8*n-18)*x+(9*n-26)*x^2+(2*n-13)*x^3-2*x^4)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 2.

P[1, x_] := 0;
P[2, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[(-(2*n^2 - 13*n + 16 + (3*n^2 - 27*n + 40)*x - (9*n - 24)*x^2 + 4*x^3)*P[n - 1, x] + (2*n - 4 + (8*n - 18)*x + (9*n - 26)*x^2 + (2*n - 13)*x^3 - 2*x^4)*D[P[n - 1, x], x])/(n - 2 + (n^2 - 3*n + 2)*x - (n - 2)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten

P(N) = {my(v = vector(N)); v[1] = 0; v[2] = 2; for(n = 3, N, my(i = n); v[i] = (-(2*n^2 - 13*n + 16 + (3*n^2 - 27*n + 40)*x - (9*n - 24)*x^2 + 4*x^3)*v[i - 1] + (2*n - 4 + (8*n - 18)*x + (9*n - 26)*x^2 + (2*n - 13)*x^3 - 2*x^4)*deriv(v[i - 1], x))/(n - 2 + (n^2 - 3*n + 2)*x - (n - 2)*x^2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Properties

• Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
  by Laguerre’s theorem on differential operators
• Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
  derived from Laguerre’s theorem on differential operators
• Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
  derived from Laguerre’s theorem on differential operators

Proof chains ? JSON

• Laguerre’s theorem on differential operators [SP14] polytool ? step ›

  • from basis_map_A013609 of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
    • Geometric basis map (elementary) polytool ? step ›

      • from Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
        • Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
        • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
            • ↑ Liu–Wang theorem with a lag row (above)
            • ↑ Liu–Wang theorem for three-term recurrences (above)
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
                • ↑ Liu–Wang theorem with a lag row (above)
                • ↑ Liu–Wang theorem for three-term recurrences (above)
                • Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›

                  • from basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
                    no recorded property covers this requirement
                • Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›

                  • from basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
                    no recorded property covers this requirement
            • ↑ Affine-current basis map theorem (above)
            • ↑ Affine-current basis map theorem (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Affine-current basis map theorem (above)
        • ↑ Affine-current basis map theorem (above)
    • Geometric basis map (elementary) polytool ? step ›

      • from Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
        • ↑ Liu–Wang theorem with a lag row (above)
        • ↑ Liu–Wang theorem for three-term recurrences (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Affine-current basis map theorem (above)
        • ↑ Affine-current basis map theorem (above)

Related ?

Same fingerprint ?

• delannoy → basis A013609 → D

References

1. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.