A227450 → D

OEIS matches ?

No OEIS matches.

OEIS submission text ?

Fields to paste into an OEIS submission: the example %e, the formula %F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows. For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched; the matched terms were compared with the published ones, which identifies the node with the entry on a finite prefix, not for every n. The PARI/GP program is not machine-checked here.

Triangle begins:
  0:    0;
  1:    4;
  2:   12,     16;
  3:   28,     96,      48;
  4:   60,    400,     480,     128;
  5:  124,   1440,    3120,    1920,     320;
  6:  252,   4816,   16800,   17920,    6720,     768;
  7:  508,  15456,   81648,  134400,   85120,   21504,    1792;
  8: 1020,  48400,  372960,  889728,  846720,  354816,   64512,   4096;
  9: 2044, 149280, 1637040, 5443200, 7304640, 4515840, 1344000, 184320, 9216;

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

P[0, x_] := 0;
P[1, x_] := 4;
P[n_, x_] := P[n, x] = Expand[-(2 + 4*x + 4*x^2)*P[n - 2, x] - (x + 2*x^2)*D[P[n - 2, x], x] + (3 + 4*x)*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 4; for(n = 2, N, my(i = n + 1); v[i] = -(2 + 4*x + 4*x^2)*v[i - 2] - (x + 2*x^2)*deriv(v[i - 2], x) + (3 + 4*x)*v[i - 1] + x*deriv(v[i - 1], x)); 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)

Proved properties

• Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-6dbcd50d3871cc63
• Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
  All coefficients of each polynomial have the same sign (after x -> -x when alternating).
  derived from the cited steps by a stated theorem: e-6dbcd50d3871cc63
• Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
  Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
  derived from the cited steps by a stated theorem: e-6dbcd50d3871cc63
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-6dbcd50d3871cc63

Proof chains

1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

• preserver_image derivative_polynomial, shift 0 e-6dbcd50d3871cc63

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

  • premise (sequence): Triangular array read by rows. T(n,k) = A008277(n,k)*2^k; n >= 1, 1 <= k <= n.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-74361f30d2bc482d root: theorem check

      Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?

Related sequences ?

No candidate equalities or related sequences.

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.