A178822 → basis A013611 → D+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:        1;
  1:       36,        24;
  2:      420,      1008,        336;
  3:     3136,     13440,      16128,       3584;
  4:    18144,    112896,     241920,     193536,       32256;
  5:    88704,    725760,    2257920,    3225600,     1935360,      258048;
  6:   384384,   3902976,   15966720,   33116160,    35481600,    17031168,     1892352;
  7:  1520640,  18450432,   93671424,  255467520,   397393920,   340623360,   136249344,    12976128;
  8:  5601024,  79073280,  479711232, 1623638016,  3321077760,  4132896768,  2952069120,  1012137984,   84344832;
  9: 19475456, 313657344, 2214051840, 8954609664, 22730932224, 37196070912, 38573703168, 23616552960, 7084965888, 524812288;

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

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((4*n^2 + 22*n + 10 + (8*n^2 + 48*n + 40)*x + (8*n + 40)*x^2)*P[n - 1, x])/(2*n^2 - n + 2*n*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] = ((4*n^2 + 22*n + 10 + (8*n^2 + 48*n + 40)*x + (8*n + 40)*x^2)*v[i - 1])/(2*n^2 - n + 2*n*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_A013611 of Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.?
        • 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
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.?
            • ↑ Row-hypergeometric rows (multiplier sequences) (above)
            • ↑ Liu–Wang theorem (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 Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.?
                • ↑ Row-hypergeometric rows (multiplier sequences) (above)
                • ↑ Liu–Wang theorem (above)
                • ↑ Iterated real-rootedness preservers (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.?
        • ↑ Row-hypergeometric rows (multiplier sequences) (above)
        • ↑ Liu–Wang theorem (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from basis_map_A013609 of Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.?
        • Geometric basis map (elementary) polytool ? step ›

          • from Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.?
            • ↑ Row-hypergeometric rows (multiplier sequences) (above)
            • ↑ Liu–Wang theorem (above)
            • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
            • ↑ Iterated real-rootedness preservers (above)
            • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from basis_map_A013609 of Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.?
            • ↑ Geometric basis map (elementary) (above)
            • Geometric basis map (elementary) polytool ? step ›

              • from Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.?
                • ↑ Row-hypergeometric rows (multiplier sequences) (above)
                • ↑ Liu–Wang theorem (above)
                • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
                • ↑ Iterated real-rootedness preservers (above)
                • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Geometric basis map (elementary) (above)

Related ?

Same fingerprint ?

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