Real-rooted atlas

A008292 → γ (scale 1/4)

nonnegative coefficients

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

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

Rows ?

nx0x1x2x3Pn(1)
111
222
3426
481624
5168816120
632416272720
764182428802725040
8128768024576793640320

Show all 15 stored rows

Generated b-files: A008303 ?

Computed in your browser ?

Technical details
Node id
n-92480a234eee36bb · revision 1 · JSON
polytool family
peak
Definition source
named_family:peak
Fingerprint
f6-b9857b4c4b3ea9b8

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 -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 ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:   1;
   2:   2;
   3:   4,      2;
   4:   8,     16;
   5:  16,     88,      16;
   6:  32,    416,     272;
   7:  64,   1824,    2880,     272;
   8: 128,   7680,   24576,    7936;
   9: 256,  31616,  185856,  137216,   7936;
  10: 512, 128512, 1304832, 1841152, 353792;
%F Formula
The row polynomials satisfy P(n,x) = (2+(n-2)*x)*P(n-1,x) + (2*x-2*x^2)*d/dx 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[(2 + (n - 2)*x)*P[n - 1, x] + (2*x - 2*x^2)*D[P[n - 1, x], x]];
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] = (2 + (n - 2)*x)*v[i - 1] + (2*x - 2*x^2)*deriv(v[i - 1], 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)

Generated with polytool c48629374597.

A008303: triangle, offset 1, from the row P1
%e Example
Triangle begins:
   1:   1;
   2:   2;
   3:   4,      2;
   4:   8,     16;
   5:  16,     88,      16;
   6:  32,    416,     272;
   7:  64,   1824,    2880,     272;
   8: 128,   7680,   24576,    7936;
   9: 256,  31616,  185856,  137216,   7936;
  10: 512, 128512, 1304832, 1841152, 353792;
%F Formula
The row polynomials satisfy P(n,x) = (2+(n-2)*x)*P(n-1,x) + (2*x-2*x^2)*d/dx 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[(2 + (n - 2)*x)*P[n - 1, x] + (2*x - 2*x^2)*D[P[n - 1, x], x]];
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] = (2 + (n - 2)*x)*v[i - 1] + (2*x - 2*x^2)*deriv(v[i - 1], 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)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 1, 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-8b7786e9ad6af8fd
  • Coefficients of one sign. Every nonzero row, n >= 1: 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-8b7786e9ad6af8fd
  • Hadamard kernel (Malo). Rows P_n, n >= 1, 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-8b7786e9ad6af8fd

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

Used in 5 proof steps

Same fingerprint (1)

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

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