A001263 → basis A013611 → θ+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:     1;
  1:     2,      8;
  2:     5,     40,      48;
  3:    14,    168,     432,      256;
  4:    42,    672,    2688,     3584,      1280;
  5:   132,   2640,   14400,    30720,     25600,      6144;
  6:   429,  10296,   71280,   211200,    288000,    165888,     28672;
  7:  1430,  40040,  336336,  1281280,   2464000,   2365440,   1003520,    131072;
  8:  4862, 155584, 1537536,  7175168,  17937920,  24600576,  17661952,   5767168,   589824;
  9: 16796, 604656, 6873984, 38019072, 117411840, 211341312, 219168768, 122683392, 31850496, 2621440;

The row polynomials satisfy (n^2+3*n+2+(2*n^3+6*n^2+4*n)*x)*P(n,x) = (4*n^2+6*n+2+(8*n^3+36*n^2+28*n)*x+(24*n^3+56*n^2+16*n)*x^2)*P(n-1,x) - ((2*n+2)*x+(4*n^2+18*n+12)*x^2+(16*n^2+40*n+16)*x^3)*d/dx 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 + 6*n + 2 + (8*n^3 + 36*n^2 + 28*n)*x + (24*n^3 + 56*n^2 + 16*n)*x^2)*P[n - 1, x] - ((2*n + 2)*x + (4*n^2 + 18*n + 12)*x^2 + (16*n^2 + 40*n + 16)*x^3)*D[P[n - 1, x], x])/(n^2 + 3*n + 2 + (2*n^3 + 6*n^2 + 4*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 + 6*n + 2 + (8*n^3 + 36*n^2 + 28*n)*x + (24*n^3 + 56*n^2 + 16*n)*x^2)*v[i - 1] - ((2*n + 2)*x + (4*n^2 + 18*n + 12)*x^2 + (16*n^2 + 40*n + 16)*x^3)*deriv(v[i - 1], x))/(n^2 + 3*n + 2 + (2*n^3 + 6*n^2 + 4*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 multiplier sequences
• Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
  derived from Laguerre’s theorem on multiplier sequences
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Laguerre’s theorem on multiplier sequences
• Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
  by Laguerre’s theorem on multiplier sequences

Proof chains ? JSON

• Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›

  • from basis_map_A013611 of Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also c…?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
        • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
        • 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
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
            • ↑ Liu–Wang theorem for three-term recurrences (above)
            • ↑ Three-term recurrence criterion (above)
            • ↑ Row-hypergeometric rows (multiplier sequences) (above)
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
                • ↑ Liu–Wang theorem for three-term recurrences (above)
                • ↑ Three-term recurrence criterion (above)
                • ↑ Row-hypergeometric rows (multiplier sequences) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
        • ↑ Liu–Wang theorem for three-term recurrences (above)
        • ↑ Three-term recurrence criterion (above)
        • ↑ Row-hypergeometric rows (multiplier sequences) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

Related ?

Same fingerprint ?

• narayana → basis A013611 → θ+1

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