A011973 → (θ+1)²

nonnegative coefficients

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

Recurrence
\(\left(n - 2\,n x + n^{2} + 3\,n^{3} x + n^{3} x^{2} + n^{4} x^{2}\right)\,P_{n}(x) = \left(-8\,x - 4\,x^{2} - 8\,x^{3} + n - 2\,n x - 14\,n x^{2} - 8\,n x^{3} + n^{2} + 8\,n^{2} x + 8\,n^{2} x^{2} + 6\,n^{2} x^{3} + 3\,n^{3} x + 11\,n^{3} x^{2} + 8\,n^{3} x^{3} + n^{4} x^{2} + 2\,n^{4} x^{3}\right)\,P_{n-1}(x) + \left(-x - 6\,x^{2} - 12\,x^{3} - 16\,x^{4} - n x - 10\,n x^{2} - 32\,n x^{3} - 32\,n x^{4} - 3\,n^{2} x^{2} - 17\,n^{2} x^{3} - 20\,n^{2} x^{4} - n^{3} x^{3} - 4\,n^{3} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3Pn(1)
011
111
2145
3189
4112922
51162744
6120541691
71249064179

Computed in your browser ?

Technical details
Node id
n-14012eded861244a · revision 1 · JSON
Definition source
derived:theta_plus_one_squared
Fingerprint
f6-ec9d723a8ce3d936

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half affine: slope 1, intercept 0)
  • 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: 1;
  1: 1;
  2: 1,  4;
  3: 1,  8;
  4: 1, 12,   9;
  5: 1, 16,  27;
  6: 1, 20,  54,  16;
  7: 1, 24,  90,  64;
  8: 1, 28, 135, 160,  25;
  9: 1, 32, 189, 320, 125;
%F Formula
The row polynomials satisfy (n^2+n+(3*n^3-2*n)*x+(n^4+n^3)*x^2)*P(n,x) = (n^2+n+(3*n^3+8*n^2-2*n-8)*x+(n^4+11*n^3+8*n^2-14*n-4)*x^2+(2*n^4+8*n^3+6*n^2-8*n-8)*x^3)*P(n-1,x) - ((n+1)*x+(3*n^2+10*n+6)*x^2+(n^3+17*n^2+32*n+12)*x^3+(4*n^3+20*n^2+32*n+16)*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 + n + (3*n^3 + 8*n^2 - 2*n - 8)*x + (n^4 + 11*n^3 + 8*n^2 - 14*n - 4)*x^2 + (2*n^4 + 8*n^3 + 6*n^2 - 8*n - 8)*x^3)*P[n - 1, x] - ((n + 1)*x + (3*n^2 + 10*n + 6)*x^2 + (n^3 + 17*n^2 + 32*n + 12)*x^3 + (4*n^3 + 20*n^2 + 32*n + 16)*x^4)*D[P[n - 1, x], x])/(n^2 + n + (3*n^3 - 2*n)*x + (n^4 + n^3)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((n^2 + n + (3*n^3 + 8*n^2 - 2*n - 8)*x + (n^4 + 11*n^3 + 8*n^2 - 14*n - 4)*x^2 + (2*n^4 + 8*n^3 + 6*n^2 - 8*n - 8)*x^3)*v[i - 1] - ((n + 1)*x + (3*n^2 + 10*n + 6)*x^2 + (n^3 + 17*n^2 + 32*n + 12)*x^3 + (4*n^3 + 20*n^2 + 32*n + 16)*x^4)*deriv(v[i - 1], x))/(n^2 + n + (3*n^3 - 2*n)*x + (n^4 + n^3)*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-268a0da4668d8a40
  • 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-268a0da4668d8a40
  • 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-268a0da4668d8a40

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

Same fingerprint (2)

Equal up to content, sign, reversal and a small index shift.

References

  1. [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
  2. [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
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.