A367270 → basis A013610 → D

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:      0;
  1:      0;
  2:      6;
  3:     36,      54;
  4:    180,     540,      324;
  5:    840,    3780,     4860,     1620;
  6:   3780,   22680,    45360,    34020,     7290;
  7:  16632,  124740,   340200,   408240,   204120,    30618;
  8:  72072,  648648,  2245320,  3742200,  3061800,  1102248,  122472;
  9: 308880, 3243240, 13621608, 29189160, 33679800, 20207880, 5511240, 472392;

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

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

P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 6; for(n = 3, N, my(i = n + 1); v[i] = ((4*n - 6 + (9*n - 18)*x)*v[i - 1] - (2*x + 6*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 - 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 ≥ 2
  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) = binomial(n, k)*binomial(n - 1, n - k - 1).?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).?
        • Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ? step › direct check
        • 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 for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).?
        • ↑ Three-term recurrence criterion (above)
        • ↑ Row-hypergeometric rows (multiplier sequences) (above)
        • ↑ Liu–Wang theorem for three-term recurrences (above)

Related ?

Same fingerprint ?

• A001263 → basis A013610
• A001263 → basis A013610 → reverse
• narayana → basis A013610 → reverse
• A132812 → basis A013610
• narayana → basis A013610

References

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