Real-rooted atlas

A249250: Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.

A249250 nonnegative coefficients

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

Recurrence from OEIS A249250
\(P_{n}(x) = \left(1 + x\right)\,P_{n-1}(x) + \left(2\,x\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + 3\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1134
216310
31915328
41123624376
51156690333208
6118105228171423568
71211534655792795131552
8124210828150012004146034240
9127276134432583858217257669311584
1013035120406258101168430357676578331648
11133435294310986228902626216350549398187386464
121365284080180094639269384594722899580041224963236224
1313963054782797586373161556181380121167479851119014941053645376
141427417164416131503663407134817044214912271427518315132179111431763200

Generated b-files: A249250 ?

Computed in your browser ?

Technical details
Node id
n-eac80c2bf8e566f5 · revision 1 · JSON
Definition source
oeis_catalog:A249250
Fingerprint
f6-034bc45f51d0b25c

Observed on the stored rows ?

  • Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (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 ?

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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 1,  3;
  2: 1,  6,   3;
  3: 1,  9,  15,    3;
  4: 1, 12,  36,   24,    3;
  5: 1, 15,  66,   90,   33,    3;
  6: 1, 18, 105,  228,  171,   42,    3;
  7: 1, 21, 153,  465,  579,  279,   51,   3;
  8: 1, 24, 210,  828, 1500, 1200,  414,  60,  3;
  9: 1, 27, 276, 1344, 3258, 3858, 2172, 576, 69, 3;
%F Formula
The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) + 2*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + 3*x;
P[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x] + 2*x*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1] + 2*x*v[i - 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.

A249250: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0: 1;
  1: 1,  3;
  2: 1,  6,   3;
  3: 1,  9,  15,    3;
  4: 1, 12,  36,   24,    3;
  5: 1, 15,  66,   90,   33,    3;
  6: 1, 18, 105,  228,  171,   42,    3;
  7: 1, 21, 153,  465,  579,  279,   51,   3;
  8: 1, 24, 210,  828, 1500, 1200,  414,  60,  3;
  9: 1, 27, 276, 1344, 3258, 3858, 2172, 576, 69, 3;
%F Formula
The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) + 2*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + 3*x;
P[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x] + 2*x*P[n - 2, x]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1] + 2*x*v[i - 2]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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-86238c6a50aeb955
  • 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-86238c6a50aeb955
  • 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-86238c6a50aeb955
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (strict, previous interlaces next) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-86238c6a50aeb955
  • Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in [-2 - sqrt(6), -2 + sqrt(6)] to roots in (-inf, +inf): every real polynomial with all roots in E = [-2 - sqrt(6), -2 + sqrt(6)] has a real-rooted image
    The linear map sending x^k to the k-th polynomial of the sequence turns polynomials with roots in one interval into real-rooted ones.
    by the cited steps: e-885864d02a352890
  • Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in [-2 - sqrt(6), -2 + sqrt(6)] to roots in [-5 - 2 sqrt(6), -5 + 2 sqrt(6)]: every real polynomial with all roots in E = [-2 - sqrt(6), -2 + sqrt(6)] has an image with all roots in I = [-5 - 2 sqrt(6), -5 + 2 sqrt(6)]
    The linear map sending x^k to the k-th polynomial of the sequence turns polynomials with roots in one interval into real-rooted ones.
    by the cited steps: e-885864d02a352890
  • Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in [-2 - sqrt(6), 0] to roots in [-5 - 2 sqrt(6), -5 + 2 sqrt(6)]: every PF input with all roots in [-2 - sqrt(6), 0] has a PF image; no larger [-R, 0] works
    The linear map sending x^k to the k-th polynomial of the sequence turns polynomials with roots in one interval into real-rooted ones.
    by the cited steps: e-885864d02a352890

Proof chains

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

Used in 14 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