A062196 → reverse → θ+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:  1;
  1:  3,    2;
  2:  6,   16,     3;
  3: 10,   60,    45,      4;
  4: 15,  160,   270,     96,      5;
  5: 21,  350,  1050,    840,    175,      6;
  6: 28,  672,  3150,   4480,   2100,    288,     7;
  7: 36, 1176,  7938,  17640,  14700,   4536,   441,     8;
  8: 45, 1920, 17640,  56448,  73500,  40320,  8820,   640,   9;
  9: 55, 2970, 35640, 155232, 291060, 249480, 97020, 15840, 891, 10;

The row polynomials satisfy (n^2+2*n+(n^4+2*n^3)*x)*P(n,x) = (n^2+4*n+4+(n^4+4*n^3+10*n^2+4*n-4)*x+(3*n^4+6*n^3+n^2-4*n)*x^2)*P(n-1,x) + ((2*n+2)*x+(2*n^3+5*n^2+2*n-2)*x^2-(2*n^3+5*n^2+4*n)*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[((n^2 + 4*n + 4 + (n^4 + 4*n^3 + 10*n^2 + 4*n - 4)*x + (3*n^4 + 6*n^3 + n^2 - 4*n)*x^2)*P[n - 1, x] + ((2*n + 2)*x + (2*n^3 + 5*n^2 + 2*n - 2)*x^2 - (2*n^3 + 5*n^2 + 4*n)*x^3)*D[P[n - 1, x], x])/(n^2 + 2*n + (n^4 + 2*n^3)*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] = ((n^2 + 4*n + 4 + (n^4 + 4*n^3 + 10*n^2 + 4*n - 4)*x + (3*n^4 + 6*n^3 + n^2 - 4*n)*x^2)*v[i - 1] + ((2*n + 2)*x + (2*n^3 + 5*n^2 + 2*n - 2)*x^2 - (2*n^3 + 5*n^2 + 4*n)*x^3)*deriv(v[i - 1], x))/(n^2 + 2*n + (n^4 + 2*n^3)*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 reversal of Triangle read by rows, T(n, k) = binomial(n, k)*binomial(n + 2, k).?
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from Triangle read by rows, T(n, k) = binomial(n, k)*binomial(n + 2, k).?
        • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? 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 reversal of Triangle read by rows, T(n, k) = binomial(n, k)*binomial(n + 2, k).?
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from Triangle read by rows, T(n, k) = binomial(n, k)*binomial(n + 2, k).?
                • ↑ Liu–Wang theorem (above)
                • ↑ Row-hypergeometric rows (multiplier sequences) (above)
    • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

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. [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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.