A371080 → θ+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0: 1;
  1: 0,          2;
  2: 0,          8,          3;
  3: 0,         56,         36,         4;
  4: 0,        560,        480,        96,         5;
  5: 0,       7280,       7560,      2080,       200,        6;
  6: 0,     116480,     139440,     47520,      6400,      360,       7;
  7: 0,    2213120,    2963520,   1183840,    200200,    15960,     588,     8;
  8: 0,   48688640,   71480640,  32363520,   6484800,   655200,   34496,   896,    9;
  9: 0, 1217216000, 1931529600, 969122560, 222028800, 26782560, 1799280, 67200, 1296, 10;

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

P[0, x_] := 1;
P[1, x_] := 2*x;
P[n_, x_] := P[n, x] = Expand[-(9*n^2 - 39*n + 42 + (6*n - 14)*x + x^2)*P[n - 2, x] - ((3*n - 7)*x + x^2)*D[P[n - 2, x], x] + (6*n - 10 + 2*x)*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(9*n^2 - 39*n + 42 + (6*n - 14)*x + x^2)*v[i - 2] - ((3*n - 7)*x + x^2)*deriv(v[i - 2], x) + (6*n - 10 + 2*x)*v[i - 1] + x*deriv(v[i - 1], 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

Proof chains ? JSON

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

  • from Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1 <= k <= m*(n + 1)} and m …?
    • Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›

      • from basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…?
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…?
            • 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

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. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.