A126351 → D

nonnegative coefficients

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13Pn(1)
00
122
25813
39382471
41411019564383
5202508558441602129
62749027305404332538412360
735868714023604303451235489675242
84414281625480724177870158010441352048480513
954222033390232428783300122523078151515336846083216113
106533006336058858828170456864990792869037260085222251024022524511
117747301128601348908870292530528168559836204903280817289261175099022528164776875
12906578190905285370823878140114076248305296992432920488293098806785921505800795491521256764052
1310489183093095653648595494903719601601370008640287529642432153121001706918850351606255190335721064969975763966
14119118304832101060259213728715010865540405275590320154010897042585827143923142332850973965993015533154126196560522937682267393577

Computed in your browser ?

Technical details
Node id
n-30e86df87c692a6b · revision 1 · JSON
Definition source
derived:derivative
Fingerprint
f6-3aec4e853484b5c1

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

OEIS matches ?

No OEIS matches.

OEIS submission text ?

Fields to paste into an OEIS submission: the example %e, the formula %F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows. For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched; the matched terms were compared with the published ones, which identifies the node with the entry on a finite prefix, not for every n. The PARI/GP program is not machine-checked here.

The atlas's own rows: n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:  0;
  1:  2;
  2:  5,    8;
  3:  9,   38,    24;
  4: 14,  110,   195,     64;
  5: 20,  250,   855,    844,    160;
  6: 27,  490,  2730,   5404,   3325,     384;
  7: 35,  868,  7140,  23604,  30345,   12354,    896;
  8: 44, 1428, 16254,  80724, 177870,  158010,  44135,   2048;
  9: 54, 2220, 33390, 232428, 783300, 1225230, 781515, 153368, 4608;
%F Formula
The row polynomials satisfy n*P(n,x) = -(n+1+(2*n^2-2)*x+(n^3-n)*x^2)*P(n-2,x) + ((n+1)*x^2+(n^2+n)*x^3)*d/dx P(n-2,x) + (2*n+1+2*n^2*x)*P(n-1,x) - n*x^2*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 2.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[(-(n + 1 + (2*n^2 - 2)*x + (n^3 - n)*x^2)*P[n - 2, x] + ((n + 1)*x^2 + (n^2 + n)*x^3)*D[P[n - 2, x], x] + (2*n + 1 + 2*n^2*x)*P[n - 1, x] - n*x^2*D[P[n - 1, x], x])/(n)]];
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] = 2; for(n = 2, N, my(i = n + 1); v[i] = (-(n + 1 + (2*n^2 - 2)*x + (n^3 - n)*x^2)*v[i - 2] + ((n + 1)*x^2 + (n^2 + n)*x^3)*deriv(v[i - 2], x) + (2*n + 1 + 2*n^2*x)*v[i - 1] - n*x^2*deriv(v[i - 1], x))/(n)); 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)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-e022596f9143390c
  • Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
    All coefficients of each polynomial have the same sign (after x -> -x when alternating).
    derived from the cited steps by a stated theorem: e-e022596f9143390c
  • Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
    Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
    derived from the cited steps by a stated theorem: e-e022596f9143390c
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-e022596f9143390c

Proof chains

1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

No candidate equalities or related sequences.

References

  1. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
  2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.