A225470 → x ↦ x+1 → basis A008277

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:           1;
  1:           4,           1;
  2:          28,          12,          1;
  3:         280,         160,         24,          1;
  4:        3640,        2520,        520,         40,         1;
  5:       58240,       46480,      11880,       1280,        60,        1;
  6:     1106560,      987840,     295960,      40040,      2660,       84,      1;
  7:    24344320,    23826880,    8090880,    1296960,    109200,     4928,    112,     1;
  8:   608608000,   643843200,  242280640,   44405760,   4463760,   257040,   8400,   144,   1;
  9: 17041024000, 19280060800, 7912262400, 1618859200, 187246080, 12946080, 542640, 13440, 180, 1;

The row polynomials satisfy P(n,x) = (3*n+1+x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(3*n + 1 + x)*P[n - 1, x] + x*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; for(n = 1, N, my(i = n + 1); v[i] = (3*n + 1 + x)*v[i - 1] + x*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 Ray basis map theorem, 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 Ray basis map theorem, Laguerre’s theorem on differential operators
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Ray basis map theorem, 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

• Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›

  • from basis_map_A007318 of Triangle read by rows, s_3(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_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)
    • Geometric basis map (elementary) 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 (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Parent-row provers of polytool (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Affine, reversal and Möbius substitutions (elementary) 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 (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Parent-row provers of polytool (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
• Laguerre’s theorem on differential operators [SP14] polytool ? step ›

  • from basis_map_A008277 of Triangle read by rows, s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
    • Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? 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 (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Parent-row provers of polytool (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? 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 (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Parent-row provers of polytool (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

Related ?

Same fingerprint ?

• A371080: Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1 <= k <= m*(n + 1…
• A035469 → reverse
• A035469: Triangle read by rows, the Bell transform of the triple factorial numbers A007559(n+1) without column 0.

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. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
5. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.