A161198 → basis A013611 → θ+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
   1:         1;
   2:         3,          16;
   3:        15,         128,         192;
   4:       105,        1136,        2880,         2048;
   5:       945,       11904,       39552,        49152,        20480;
   6:     10395,      146064,      577920,       962560,       716800,       196608;
   7:    135135,     2065152,     9265728,     18677760,     18944000,      9437184,      1835008;
   8:   2027025,    33139440,   163767744,    379000832,    470937600,    323420160,    115605504,    16777216;
   9:  34459425,   595802880,  3181724928,   8189870080,  11795947520,  10019143680,   4983881728,  1342177280,   150994944;
  10: 654729075, 11871605520, 67602408192, 189545930752, 306021703680, 303604826112, 188205760512, 71068286976, 14948499456, 1342177280;

The row polynomials satisfy P(n,x) = -(4*n^2-12*n+9+(32*n-48)*x+64*x^2)*P(n-2,x) + (4*n-4+16*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 3 + 16*x.

P[1, x_] := 1;
P[2, x_] := 3 + 16*x;
P[n_, x_] := P[n, x] = Expand[-(4*n^2 - 12*n + 9 + (32*n - 48)*x + 64*x^2)*P[n - 2, x] + (4*n - 4 + 16*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten

P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3 + 16*x; for(n = 3, N, my(i = n); v[i] = -(4*n^2 - 12*n + 9 + (32*n - 48)*x + 64*x^2)*v[i - 2] + (4*n - 4 + 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, 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 multiplier sequences
• Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
  derived from Laguerre’s theorem on multiplier sequences
• Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
  derived from Laguerre’s theorem on multiplier sequences
• Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
  by Laguerre’s theorem on multiplier sequences

Proof chains ? JSON

• Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›

  • from basis_map_A013611 of Triangle of polynomial coefficients related to the series expansions of (1-x)^((-1-2*n)/2).?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle of polynomial coefficients related to the series expansions of (1-x)^((-1-2*n)/2).?
        • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? step › direct check
        • 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
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle of polynomial coefficients related to the series expansions of (1-x)^((-1-2*n)/2).?
        • ↑ Liu–Wang theorem (above)
        • ↑ Parent-row provers of polytool (above)
        • ↑ Iterated real-rootedness preservers (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. [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
4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.