A120909 → D

nonnegative coefficients only rational roots

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

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

Rows ?

nx0x1x2x3x4x5x6Pn(1)
00
166
2122436
3187272162
424144288192648
5302407209604802430
63636014402880288011528748
74250425206720100808064268830618

Computed in your browser ?

Technical details
Node id
n-076de49b14800916 · revision 1 · JSON
Definition source
derived:derivative
Fingerprint
f6-11aec07ce60b6d61

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 ℚ): yes

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:  6;
  2: 12,  24;
  3: 18,  72,   72;
  4: 24, 144,  288,   192;
  5: 30, 240,  720,   960,   480;
  6: 36, 360, 1440,  2880,  2880,  1152;
  7: 42, 504, 2520,  6720, 10080,  8064,  2688;
  8: 48, 672, 4032, 13440, 26880, 32256, 21504,  6144;
  9: 54, 864, 6048, 24192, 60480, 96768, 96768, 55296, 13824;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (n+2*n*x)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 6.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 6;
P[n_, x_] := P[n, x] = Expand[Together[((n + 2*n*x)*P[n - 1, x])/(n - 1)]];
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] = 6; for(n = 2, N, my(i = n + 1); v[i] = ((n + 2*n*x)*v[i - 1])/(n - 1)); 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-13c4b00cf881ee86
  • 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-13c4b00cf881ee86
  • 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-13c4b00cf881ee86
  • 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-13c4b00cf881ee86

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 (67)

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