A081579 → 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(-9 - 2\,x + x^{2} + 14\,n - 3\,n x - n x^{2} - 5\,n^{2} + 5\,n^{2} x\right)\,P_{n}(x) = \left(-4 - 104\,x - 30\,x^{2} - 2\,x^{3} + 9\,n + 177\,n x + 24\,n x^{2} - 5\,n^{2} - 45\,n^{2} x\right)\,P_{n-1}(x) + \left(-4\,x - 73\,x^{2} - 22\,x^{3} - x^{4} + 5\,n x + 90\,n x^{2} + 5\,n x^{3}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13Pn(1)
00
111
2628
31122336
41692484160
521212318845640
626382118876413062496
73160230334044150518679408
836872622814424103802616252834816
94111921114838904486302229641723289126720
10461562181688698416938013047642392624841410455680
1151198227663170664472630567156298662737688919510111622016
125624524000830444411208801947336156923260888812002412260616125726208
136129725557850532423547555561016648785237676081136979185260163467321320074496
1466354274748792804450863013766946220632721835592881155341982010274076212528581469959680

Computed in your browser ?

Technical details
Node id
n-698985fa41daeea7 · revision 1 · JSON
Definition source
derived:derivative
Fingerprint
f6-51497c20c36d8a43

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:  1;
  2:  6,    2;
  3: 11,   22,     3;
  4: 16,   92,    48,     4;
  5: 21,  212,   318,    84,     5;
  6: 26,  382,  1188,   764,   130,     6;
  7: 31,  602,  3033,  4044,  1505,   186,    7;
  8: 36,  872,  6228, 14424, 10380,  2616,  252,   8;
  9: 41, 1192, 11148, 38904, 48630, 22296, 4172, 328, 9;
%F Formula
The row polynomials satisfy -(5*n^2-14*n+9-(5*n^2-3*n-2)*x+(n-1)*x^2)*P(n,x) = -(5*n^2-9*n+4+(45*n^2-177*n+104)*x-(24*n-30)*x^2+2*x^3)*P(n-1,x) + ((5*n-4)*x+(90*n-73)*x^2+(5*n-22)*x^3-x^4)*d/dx 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[Together[(-(5*n^2 - 9*n + 4 + (45*n^2 - 177*n + 104)*x - (24*n - 30)*x^2 + 2*x^3)*P[n - 1, x] + ((5*n - 4)*x + (90*n - 73)*x^2 + (5*n - 22)*x^3 - x^4)*D[P[n - 1, x], x])/(-5*n^2 + 14*n - 9 + (5*n^2 - 3*n - 2)*x - (n - 1)*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] = (-(5*n^2 - 9*n + 4 + (45*n^2 - 177*n + 104)*x - (24*n - 30)*x^2 + 2*x^3)*v[i - 1] + ((5*n - 4)*x + (90*n - 73)*x^2 + (5*n - 22)*x^3 - x^4)*deriv(v[i - 1], x))/(-5*n^2 + 14*n - 9 + (5*n^2 - 3*n - 2)*x - (n - 1)*x^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)

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-3c2e5774479af757
  • 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-3c2e5774479af757
  • 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-3c2e5774479af757
  • 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-3c2e5774479af757

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.