A225471 → basis A013611 → D+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:            1;
  1:            8,            4;
  2:           80,           80,           16;
  3:         1088,         1472,          576,           64;
  4:        18944,        30720,        16640,         3584,          256;
  5:       403456,       741376,       491520,       148480,        20480,        1024;
  6:     10174464,     20529152,     15683584,      5877760,      1146880,      110592,       4096;
  7:    296681472,    644415488,    547864576,    239353856,     58490880,     8028160,     573440,     16384;
  8:   9824108544,  22664445952,  20969947136,  10294394880,   2957574144,   511967232,   52297728,   2883584,    65536;
  9: 364237553664, 883943276544, 876541378560, 472116101120, 153535119360, 31450202112, 4073717760, 322437120, 14155776, 262144;

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

P[0, x_] := 1;
P[1, x_] := 8 + 4*x;
P[n_, x_] := P[n, x] = Expand[-(16*n^2 - 32*n + 16 + (32*n - 32)*x + 16*x^2)*P[n - 2, x] + (8*n - 4 + 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] = 1; v[2] = 8 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(16*n^2 - 32*n + 16 + (32*n - 32)*x + 16*x^2)*v[i - 2] + (8*n - 4 + 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 read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows, s_4(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
        • Parent-row provers of polytool polytool ? step › direct check
        • Geometric basis map (elementary) polytool ? step ›

          • from basis_map_A007318 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A …?
            • Geometric basis map (elementary) polytool ? step ›

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

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

      • from Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.?
        • ↑ Liu–Wang theorem (above)
        • ↑ Parent-row provers of polytool (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Geometric basis map (elementary) polytool ? step ›

      • from basis_map_A013609 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A …?
        • Geometric basis map (elementary) polytool ? step ›

          • from Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1…?
            • ↑ Liu–Wang theorem (above)
            • ↑ Parent-row provers of polytool (above)
            • ↑ Iterated real-rootedness preservers (above)
        • Geometric basis map (elementary) polytool ? step ›

          • from Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1…?
            • ↑ Liu–Wang theorem (above)
            • ↑ Parent-row provers of polytool (above)
            • ↑ Iterated real-rootedness preservers (above)

Related ?

Same fingerprint ?

• A225470 → basis A013610 → D+1
• A028338 → basis A013609 → D+1
• A130534 → D+1 → reverse
• A130534 → D+1

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.