A137320 → basis A013611 → D

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:        0;
  1:        8;
  2:       40,       128;
  3:      208,      1152,       1536;
  4:     1232,      9088,      21504,       16384;
  5:     8352,     74240,     238080,      327680,      163840;
  6:    64224,    653312,    2557440,     4833280,     4423680,     1572864;
  7:   554112,   6254080,   28299264,    65945600,    83722240,    55050240,    14680064;
  8:  5309568,  65152512,  329742336,   895369216,  1412956160,  1299185664,   645922816,  134217728;
  9: 55998720, 736478208, 4079253504, 12470943744, 23083253760, 26556235776, 18584961024, 7247757312, 1207959552;

The row polynomials satisfy P(n,x) = -(n^2+16*n*x+64*x^2)*P(n-2,x) + (2*n+1+16*x)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 8.

P[0, x_] := 0;
P[1, x_] := 8;
P[n_, x_] := P[n, x] = Expand[-(n^2 + 16*n*x + 64*x^2)*P[n - 2, x] + (2*n + 1 + 16*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] = 8; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 + 16*n*x + 64*x^2)*v[i - 2] + (2*n + 1 + 16*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 Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1…?
    • Geometric basis map (elementary) polytool ? step ›

      • from Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[…?
        • 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 Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[…?
        • ↑ Parent-row provers of polytool (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Parent-row provers of polytool (above)

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.