A225470 → D+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:          1;
  1:          3,          1;
  2:         17,          9,          1;
  3:        146,         96,         18,         1;
  4:       1686,       1268,        309,        30,        1;
  5:      24484,      20244,       5825,       755,       45,       1;
  6:     428548,     380796,     123309,     19255,     1560,      63,      1;
  7:    8780400,    8263576,    2927820,    522564,    51730,    2877,     84,    1;
  8:  206138000,  203434248,   77439424,  15310736,  1752009,  120316,   4886,  108,   1;
  9: 5455930400, 5605224048, 2263678596, 485725260, 62138979, 4975425, 251538, 7794, 135, 1;

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

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

P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + x; for(n = 2, N, my(i = n + 1); v[i] = -(9*n^2 - 24*n + 16 + (6*n - 8)*x + x^2)*v[i - 2] + (6*n - 5 + 2*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 Triangle read by rows, s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.?
    • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? step › direct check
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1…?
        • 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 basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…?
            • Parent-row provers of polytool polytool ? step › direct check
        • Geometric basis map (elementary) polytool ? step ›

          • from basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…?
            • ↑ Parent-row provers of polytool (above)
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…?
            • ↑ Parent-row provers of polytool (above)
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1…?
        • ↑ Liu–Wang theorem (above)
        • ↑ Parent-row provers of polytool (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • 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
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1…?
        • ↑ Liu–Wang theorem (above)
        • ↑ Parent-row provers of polytool (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (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.