A038281 → x ↦ x+1 → D

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:           66,            18;
  1:         1089,           594,            81;
  2:        15972,         13068,          3564,           324;
  3:       219615,        239580,         98010,         17820,         1215;
  4:      2898918,       3953070,       2156220,        588060,        80190,         4374;
  5:     37202781,      60877278,      41507235,      15093540,      3087315,       336798,       15309;
  6:    467692104,     892866744,     730527336,     332057880,     90561240,     14819112,     1347192,       52488;
  7:   5787689787,   12627686808,   12053701044,    6574746024,   2241390690,    489030696,    66686004,     5196312,     177147;
  8:  70738430730,  173630693610,  189415302120,  120537010440,  49310595180,  13448344140,  2445153480,   285797160,   19486170,   590490;
  9: 855935011833, 2334368214090, 2864906444565, 2083568323320, 994430336130, 325449928188, 73965892770, 11527152120, 1178913285, 71449290, 1948617;

The row polynomials satisfy (n+1)*P(n,x) = (11*n+22+(3*n+6)*x)*P(n-1,x) for n >= 1, with P(0,x) = 66 + 18*x.

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

P(N) = {my(v = vector(N + 1)); v[1] = 66 + 18*x; for(n = 1, N, my(i = n + 1); v[i] = ((11*n + 22 + (3*n + 6)*x)*v[i - 1])/(n + 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_A007318 of Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*3^j.?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*3^j.?
        • 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: (i,j)-th entry is binomial(i,j)*3^(i-j)*8^j.?
            • 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 whose (i,j)-th entry is binomial(i,j)*8^(i-j)*3^j.?
                • ↑ 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
                • 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
            • Parent-row provers of polytool polytool ? step › direct check
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Parent-row provers of polytool (above)
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*3^j.?
        • ↑ Row-hypergeometric rows (multiplier sequences) (above)
        • ↑ Liu–Wang theorem (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Parent-row provers of polytool (above)

Related ?

Same fingerprint ?

• A038281 → x ↦ x+1 → reverse
• A013622 → x ↦ x/(x+1) → x ↦ x/(x+1)
• A038303 → basis A013610 → D
• A038281 → x ↦ x+1
• A013618 → basis A013611
• A038226 → x ↦ x/(x+1)
• A038303 → basis A013610
• A038303 → basis A013610 → reverse

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.