A086645 → γ → x ↦ x+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
   1:    1;
   2:    1;
   3:    5,     4;
   4:   13,    12;
   5:   41,    56,    16;
   6:  121,   200,    80;
   7:  365,   732,   432,    64;
   8: 1093,  2548,  1904,   448;
   9: 3281,  8752,  8032,  2816,  256;
  10: 9841, 29520, 31968, 14592, 2304;

The row polynomials satisfy (n-2)*P(n,x) = (5*n-10+(4*n-8)*x)*P(n-1,x) - (6+14*x+8*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1.

P[1, x_] := 1;
P[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((5*n - 10 + (4*n - 8)*x)*P[n - 1, x] - (6 + 14*x + 8*x^2)*D[P[n - 1, x], x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten

P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1; for(n = 3, N, my(i = n); v[i] = ((5*n - 10 + (4*n - 8)*x)*v[i - 1] - (6 + 14*x + 8*x^2)*deriv(v[i - 1], x))/(n - 2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Properties

• Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, -1]
  by Affine, reversal and Möbius substitutions (elementary)
• Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
  derived from Affine, reversal and Möbius substitutions (elementary), Geometric basis map (elementary)
• Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
  derived from Affine, reversal and Möbius substitutions (elementary), Geometric basis map (elementary)
• Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
  by Geometric basis map (elementary)
• Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
  by Geometric basis map (elementary)

Proof chains ? JSON

• Geometric basis map (elementary) polytool ? step ›

  • from gamma_polynomial of Triangle read by rows: T(n, k) = binomial(2n, 2k).?
    • Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›

      • from Triangle read by rows: T(n, k) = binomial(2n, 2k).?
        • Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ? step › direct check
        • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Triangle read by rows: T(n, k) = binomial(2n, 2k).?
            • ↑ Three-term recurrence criterion (above)
            • ↑ Liu–Wang theorem for three-term recurrences (above)
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from Triangle read by rows: T(n, k) = binomial(2n, 2k).?
                • ↑ Three-term recurrence criterion (above)
                • ↑ Liu–Wang theorem for three-term recurrences (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
• Ore-algebra identity of two definitions polytool ? step › direct check
• Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

  • from gamma_polynomial of Triangle read by rows: T(n, k) = binomial(2n, 2k).?
    • ↑ Gamma criterion (above)

Related ?

Same fingerprint ?

• A013609 → Veronese 2 → x ↦ x+1

References

1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
2. [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
3. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023