A085478 → basis A013611 → D

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:     0;
  1:     0;
  2:     4;
  3:    20,     32;
  4:    76,    256,     192;
  5:   260,   1344,    2112,    1024;
  6:   840,   5856,   14208,   14336,    5120;
  7:  2616,  22944,   75648,  117760,   87040,   24576;
  8:  7940,  83904,  350400,  742400,  844800,  491520,  114688;
  9: 23644, 292288, 1478976, 3978240, 6159360, 5505024, 2637824, 524288;

The row polynomials satisfy (8*n^2-28*n+24)*P(n,x) = (12*n^2-16*n+(16*n^2-16*n)*x)*P(n-1,x) + (5*n-5+(24*n-24)*x+(16*n-16)*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 4.

P[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 4;
P[n_, x_] := P[n, x] = Expand[Together[((12*n^2 - 16*n + (16*n^2 - 16*n)*x)*P[n - 1, x] + (5*n - 5 + (24*n - 24)*x + (16*n - 16)*x^2)*D[P[n - 1, x], x])/(8*n^2 - 28*n + 24)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

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

Properties

• Real-rooted? Every row P_n, n ≥ 0, 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 ≥ 0: the coefficients of P_n have one sign
  derived from Laguerre’s theorem on differential operators
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Laguerre’s theorem on differential operators
• Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
  by Laguerre’s theorem on differential operators

Proof chains ? JSON

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

  • from basis_map_A013611 of Triangle T(n,k), read by rows given by [1,0,1,0,0,0,0,0,0,...] DELTA [0,1,0,0,0,0,0,0,0,...] where…?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle T(n,k), read by rows given by [1,0,1,0,0,0,0,0,0,...] DELTA [0,1,0,0,0,0,0,0,0,...] where DELTA is the operato…?
        • Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ? 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
        • Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ? step › direct check
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Triangle T(n,k), 0 <= k <= n, read by rows given by [0, 1, 0, 0, 0, 0, ...] DELTA [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, ...] w…?
            • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle T(n,k), read by rows given by [1,0,1,0,0,0,0,0,0,...] DELTA [0,1,0,0,0,0,0,0,0,...] where DELTA is the operato…?
        • ↑ Three-term recurrence criterion (above)
        • ↑ Liu–Wang theorem for three-term recurrences (above)
        • ↑ Three-term recurrence criterion (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

References

1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
2. [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
3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
4. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023