A120909 → basis A013610 → D+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:       3;
  1:      27,       18;
  2:     135,      324,       108;
  3:     567,     2430,      2916,       648;
  4:    2187,    13608,     29160,     23328,       3888;
  5:    8019,    65610,    204120,    291600,     174960,      23328;
  6:   28431,   288684,   1180980,   2449440,    2624400,    1259712,     139968;
  7:   98415,  1194102,   6062364,  16533720,   25719120,   22044960,    8817984,     839808;
  8:  334611,  4723920,  28658448,  96997824,  198404640,  246903552,  176359680,   60466176,   5038848;
  9: 1121931, 18068994, 127545840, 515852064, 1309470624, 2142770112, 2222131968, 1360488960, 408146688, 30233088;

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

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

P(N) = {my(v = vector(N + 1)); v[1] = 3; for(n = 1, N, my(i = n + 1); v[i] = ((6*n + 3 + (12*n + 12)*x + 12*x^2)*v[i - 1])/(2*n - 1 + 2*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 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_A013610 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subw…?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…?
        • Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
        • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? 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 number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…?
            • Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
            • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? step › direct check
            • Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
            • Parent-row provers of polytool polytool ? step › direct check
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…?
                • ↑ Row-hypergeometric rows (multiplier sequences) (above)
                • ↑ Liu–Wang theorem (above)
                • ↑ Iterated real-rootedness preservers (above)
                • Parent-row provers of polytool polytool ? step › direct check
        • ↑ Parent-row provers of polytool (above)
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from basis_map_A013610 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, …?
        • Geometric basis map (elementary) polytool ? step ›

          • from Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…?
            • ↑ Row-hypergeometric rows (multiplier sequences) (above)
            • ↑ Liu–Wang theorem (above)
            • ↑ Iterated real-rootedness preservers (above)
            • ↑ Parent-row provers of polytool (above)
            • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from basis_map_A013610 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, …?
            • ↑ Geometric basis map (elementary) (above)

Related ?

Same fingerprint ?

• A136572 → basis A013609 → D+1
• A013609 → D+1
• A130123 → basis A013609 → D+1
• A085881 → basis A013611 → D+1
• A178821 → basis A013611 → D+1
• basis-map coefficients of A026729, shifted → basis A013609 → D+1
• basis-map coefficients of A030528, shifted → basis A013609 → D+1
• basis-map coefficients of A026729 → basis A013609 → D+1
• A038208 → basis A013611 → D+1
• A134082 → basis A013609
• A013609 → D → D+1
• A038221 → basis A013611 → D+1
• A178822 → basis A013611 → D+1
• A356546 → basis A013611 → D+1
• A120909 → D+1
• A028326 → basis A013611 → D+1
• A156992 → basis A013611 → D+1
• A085880 → basis A013611 → D+1
• basis-map coefficients of A112227 → basis A013609 → D+1
• A178820 → basis A013611 → D+1
• A013609 → basis A013610 → D+1
• A196347 → basis A013611 → 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.