A286718 → basis A013610 → (θ+1)²

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:          1;
  1:          2,          12;
  2:         10,          84,           81;
  3:         80,         792,         1215,          432;
  4:        880,        9672,        18711,        11232,        2025;
  5:      12320,      145968,       327240,       257040,       81000,        8748;
  6:     209440,     2629296,      6548364,      6114960,     2581875,      498636,      35721;
  7:    4188800,    55099200,    148715028,    157223808,    80301375,    21126420,    2750517,    139968;
  8:   96342400,  1317547200,   3792365244,   4409294400,  2583918225,   832809600,  149528106,  13996800,   531441;
  9: 2504902400, 35412336000, 107494939944, 134867602368, 87850441350, 32815576332, 7288369956, 949822848, 66961566, 1968300;

The row polynomials satisfy P(n,x) = -(9*n^2-24*n+16+(36*n-48)*x-81*x^2)*P(n-2,x) + ((36*n-48)*x^2+36*x^3)*d/dx P(n-2,x) + (6*n-5+12*x)*P(n-1,x) - 12*x^2*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 12*x.

P[0, x_] := 1;
P[1, x_] := 2 + 12*x;
P[n_, x_] := P[n, x] = Expand[-(9*n^2 - 24*n + 16 + (36*n - 48)*x - 81*x^2)*P[n - 2, x] + ((36*n - 48)*x^2 + 36*x^3)*D[P[n - 2, x], x] + (6*n - 5 + 12*x)*P[n - 1, x] - 12*x^2*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] = 1; v[2] = 2 + 12*x; for(n = 2, N, my(i = n + 1); v[i] = -(9*n^2 - 24*n + 16 + (36*n - 48)*x - 81*x^2)*v[i - 2] + ((36*n - 48)*x^2 + 36*x^3)*deriv(v[i - 2], x) + (6*n - 5 + 12*x)*v[i - 1] - 12*x^2*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)

Properties

• Real-rooted? Every row P_n, n ≥ 0, 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 ≥ 0: the coefficients of P_n have one sign
  derived from Laguerre’s theorem on multiplier sequences
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, 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 ≥ 1
  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_A013610 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A …?
    • 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)

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.