A304334 → D

nonnegative coefficients

Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel

Recurrence

\(P_{n}(x) = \left(-12\,x^{2}\right)\,P_{n-2}(x) + \left(-4\,x^{2} - 8\,x^{3}\right)\,P_{n-2}'(x) + \left(-2\,x^{3}\right)\,P_{n-2}''(x) + \left(1 + 12\,x\right)\,P_{n-1}(x) + \left(3\,x + 4\,x^{2}\right)\,P_{n-1}'(x) + \left(x^{2}\right)\,P_{n-1}''(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6Pn(1)
00
111
211213
3160180241
41252252033606133
5110202646010080075600203881
6140922534402106720415800019958408518093
711638023423403843840015135120018162144060540480434310241
Technical details
Node id
n-5af4ea1ce3f85b64 · revision 0 · JSON
Definition source
derived:derivative
Fingerprint
f6-784ef30fa3492623

Observed on the stored rows ?

  • Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (affine: slope 1, intercept -1)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): no

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 0;
  1: 1;
  2: 1,     12;
  3: 1,     60,       180;
  4: 1,    252,      2520,        3360;
  5: 1,   1020,     26460,      100800,        75600;
  6: 1,   4092,    253440,     2106720,      4158000,      1995840;
  7: 1,  16380,   2342340,    38438400,    151351200,    181621440,     60540480;
  8: 1,  65532,  21326760,   658738080,   4648644000,  10534043520,   8475667200,   2075673600;
  9: 1, 262140, 192923820, 10937908800, 131037706800, 501949768320, 734840346240, 423437414400, 79394515200;
%F Formula
The row polynomials satisfy P(n,x) = -12*x^2*P(n-2,x) - (4*x^2+8*x^3)*d/dx P(n-2,x) - 2*x^3*d^2/dx^2 P(n-2,x) + (1+12*x)*P(n-1,x) + (3*x+4*x^2)*d/dx P(n-1,x) + x^2*d^2/dx^2 P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 1.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[-12*x^2*P[n - 2, x] - (4*x^2 + 8*x^3)*D[P[n - 2, x], x] - 2*x^3*D[P[n - 2, x], {x, 2}] + (1 + 12*x)*P[n - 1, x] + (3*x + 4*x^2)*D[P[n - 1, x], x] + x^2*D[P[n - 1, x], {x, 2}]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = -12*x^2*v[i - 2] - (4*x^2 + 8*x^3)*deriv(v[i - 2], x) - 2*x^3*deriv(deriv(v[i - 2], x), x) + (1 + 12*x)*v[i - 1] + (3*x + 4*x^2)*deriv(v[i - 1], x) + x^2*deriv(deriv(v[i - 1], x), 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)

polytool c48629374597

Properties

Proof chains ? JSON

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.