A269944 → x ↦ x+1 → θ+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:          1;
  1:          1,           2;
  2:          2,           6,           3;
  3:         10,          34,          24,          4;
  4:        100,         360,         291,         72,          5;
  5:       1700,        6320,        5487,       1612,        175,         6;
  6:      44200,      167720,      152142,      49228,       6565,       366,       7;
  7:    1635400,     6294040,     5880834,    2024292,     304440,     21420,     686,      8;
  8:   81770000,   317972800,   303482760,  109055712,   17752365,   1436328,   59290,   1184,    9;
  9: 5315050000, 20831772000, 20203338600, 7493264960, 1290223365, 114664158, 5529566, 144720, 1917, 10;

The row polynomials satisfy P(n,x) = -(n^4-8*n^3+26*n^2-40*n+25+(2*n^2-8*n+10)*x+x^2)*P(n-2,x) + (2*n^2-6*n+7+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 2*x.

P[0, x_] := 1;
P[1, x_] := 1 + 2*x;
P[n_, x_] := P[n, x] = Expand[-(n^4 - 8*n^3 + 26*n^2 - 40*n + 25 + (2*n^2 - 8*n + 10)*x + x^2)*P[n - 2, x] + (2*n^2 - 6*n + 7 + 2*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^4 - 8*n^3 + 26*n^2 - 40*n + 25 + (2*n^2 - 8*n + 10)*x + x^2)*v[i - 2] + (2*n^2 - 6*n + 7 + 2*x)*v[i - 1]); 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_A007318 of Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k >…?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k)…?
        • 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
        • Parent-row provers of polytool polytool ? step › direct check
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k)…?
        • ↑ Parent-row provers of polytool (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Parent-row provers of polytool (above)
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k)…?
        • ↑ Parent-row provers of polytool (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Parent-row provers of polytool (above)

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