A290598 → reverse

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(1 - 8\,x + 30\,x^{2} + 6\,n x - 33\,n x^{2} + 9\,n^{2} x^{2}\right)\,P_{n-1}(x) + \left(-6\,x^{2} + 42\,x^{3} - 18\,n x^{3}\right)\,P_{n-1}'(x) + \left(9\,x^{4}\right)\,P_{n-1}''(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2145
31142843
4130210280521
5152780364036408113
61802080208007280058240154001
71114456079040592800165984011065603442915
811548778234080304304018258240426025602434432088491173
Technical details
Node id
n-b8dd1392a9092a24 · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-d99ad6edcacedc3c

Observed on the stored rows ?

  • Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1: 1;
   2: 1,   4;
   3: 1,  14,    28;
   4: 1,  30,   210,     280;
   5: 1,  52,   780,    3640,     3640;
   6: 1,  80,  2080,   20800,    72800,     58240;
   7: 1, 114,  4560,   79040,   592800,   1659840,    1106560;
   8: 1, 154,  8778,  234080,  3043040,  18258240,   42602560,    24344320;
   9: 1, 200, 15400,  585200, 11704000, 121721600,  608608000,  1217216000,   608608000;
  10: 1, 252, 25200, 1293600, 36867600, 589881600, 5112307200, 21909888000, 38342304000, 17041024000;
%F Formula
The row polynomials satisfy P(n,x) = (1+(6*n-8)*x+(9*n^2-33*n+30)*x^2)*P(n-1,x) - (6*x^2+(18*n-42)*x^3)*d/dx P(n-1,x) + 9*x^4*d^2/dx^2 P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + (6*n - 8)*x + (9*n^2 - 33*n + 30)*x^2)*P[n - 1, x] - (6*x^2 + (18*n - 42)*x^3)*D[P[n - 1, x], x] + 9*x^4*D[P[n - 1, x], {x, 2}]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + (6*n - 8)*x + (9*n^2 - 33*n + 30)*x^2)*v[i - 1] - (6*x^2 + (18*n - 42)*x^3)*deriv(v[i - 1], x) + 9*x^4*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, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

Same fingerprint ?

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.