A026374 → θ+1 → reverse

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:  1;
  1:  2,   1;
  2:  3,   6,   1;
  3:  4,  12,   8,    1;
  4:  5,  24,  33,   12,    1;
  5:  6,  35,  68,   51,   14,    1;
  6:  7,  54, 150,  180,   90,   18,   1;
  7:  8,  70, 234,  375,  300,  117,  20,   1;
  8:  9,  96, 406,  864,  975,  576, 174,  24,  1;
  9: 10, 117, 560, 1414, 2034, 1695, 808, 210, 26, 1;

The row polynomials satisfy P(n,x) = -(1+6*x+11*x^2+6*x^3+x^4)*P(n-4,x) + (2+6*x+2*x^2)*P(n-2,x) for n >= 4, with P(0,x) = 1, P(1,x) = 2 + x, P(2,x) = 3 + 6*x + x^2, P(3,x) = 4 + 12*x + 8*x^2 + x^3.

P[0, x_] := 1;
P[1, x_] := 2 + x;
P[2, x_] := 3 + 6*x + x^2;
P[3, x_] := 4 + 12*x + 8*x^2 + x^3;
P[n_, x_] := P[n, x] = Expand[-(1 + 6*x + 11*x^2 + 6*x^3 + x^4)*P[n - 4, x] + (2 + 6*x + 2*x^2)*P[n - 2, 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; v[3] = 3 + 6*x + x^2; v[4] = 4 + 12*x + 8*x^2 + x^3; for(n = 4, N, my(i = n + 1); v[i] = -(1 + 6*x + 11*x^2 + 6*x^3 + x^4)*v[i - 4] + (2 + 6*x + 2*x^2)*v[i - 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 Affine, reversal and Möbius substitutions (elementary)
• Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
  derived from Affine, reversal and Möbius substitutions (elementary)
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Affine, reversal and Möbius substitutions (elementary)

Proof chains ? JSON

• Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

  • from theta_plus_one of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) f…?
    • Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›

      • from Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …?
        • 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
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …?
            • ↑ Iterated real-rootedness preservers (above)
            • ↑ Parent-row provers of polytool (above)

Related ?

Same fingerprint ?

• A026374 → θ+1

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.