A132393 → basis A013611 → D

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:       0;
  1:       4;
  2:      12,       32;
  3:      44,      192,       192;
  4:     200,     1120,      1920,      1024;
  5:    1096,     7200,     16320,     15360,      5120;
  6:    7056,    51968,    141120,    179200,    107520,     24576;
  7:   52272,   420224,   1299648,   2007040,   1648640,    688128,   114688;
  8:  438336,  3779968,  12918528,  22987776,  23224320,  13418496,  4128768,   524288;
  9: 4106304, 37526400, 138946560, 275788800, 323957760, 232243200, 99778560, 23592960, 2359296;

The row polynomials satisfy P(n,x) = -(n^2-2*n+1+(8*n-8)*x+16*x^2)*P(n-2,x) + (2*n-1+8*x)*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[-(n^2 - 2*n + 1 + (8*n - 8)*x + 16*x^2)*P[n - 2, x] + (2*n - 1 + 8*x)*P[n - 1, 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] = -(n^2 - 2*n + 1 + (8*n - 8)*x + 16*x^2)*v[i - 2] + (2*n - 1 + 8*x)*v[i - 1]); 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 ≥ 1
  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 of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 …?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.?
        • Parent-row provers of polytool polytool ? step › direct check
        • Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
        • Parent-row provers of polytool polytool ? step › direct check
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.?
        • ↑ Parent-row provers of polytool (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Parent-row provers of polytool (above)

Related ?

Same fingerprint ?

• A028421 → basis A013611
• A132393 → D → basis A013611

References

1. [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
2. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.