Real-rooted atlas

A028326: Twice Pascal's triangle A007318: T(n,k) = 2*C(n,k).

A028326 palindromic γ-positive nonnegative coefficients only rational roots

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

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
022
1224
22428
3266216
428128232
5210202010264
6212304030122128
721442707042142256

Show all 15 stored rows

Generated b-files: A028326, A028326 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-089a9b4f824a1c20 · revision 2 · JSON
Definition source
oeis_catalog:A028326
Fingerprint
f6-77a7ed3b1d5f257e

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: yes
  • γ-positive (gamma_positive): yes
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): yes

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: 2;
  1: 2,  2;
  2: 2,  4,  2;
  3: 2,  6,  6,   2;
  4: 2,  8, 12,   8,   2;
  5: 2, 10, 20,  20,  10,   2;
  6: 2, 12, 30,  40,  30,  12,   2;
  7: 2, 14, 42,  70,  70,  42,  14,  2;
  8: 2, 16, 56, 112, 140, 112,  56, 16,  2;
  9: 2, 18, 72, 168, 252, 252, 168, 72, 18, 2;
%F Formula
The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) for n >= 1, with P(0,x) = 2.
%t Mathematica
P[0, x_] := 2;
P[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 2; for(n = 1, N, my(i = n + 1); v[i] = (1 + x)*v[i - 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.

A028326: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0: 2;
  1: 2,  2;
  2: 2,  4,  2;
  3: 2,  6,  6,   2;
  4: 2,  8, 12,   8,   2;
  5: 2, 10, 20,  20,  10,   2;
  6: 2, 12, 30,  40,  30,  12,   2;
  7: 2, 14, 42,  70,  70,  42,  14,  2;
  8: 2, 16, 56, 112, 140, 112,  56, 16,  2;
  9: 2, 18, 72, 168, 252, 252, 168, 72, 18, 2;
%F Formula
The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) for n >= 1, with P(0,x) = 2.
%t Mathematica
P[0, x_] := 2;
P[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, 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] = 2; for(n = 1, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1]); 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.

A028326: reversed triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0: 2;
  1: 2,  2;
  2: 2,  4,  2;
  3: 2,  6,  6,   2;
  4: 2,  8, 12,   8,   2;
  5: 2, 10, 20,  20,  10,   2;
  6: 2, 12, 30,  40,  30,  12,   2;
  7: 2, 14, 42,  70,  70,  42,  14,  2;
  8: 2, 16, 56, 112, 140, 112,  56, 16,  2;
  9: 2, 18, 72, 168, 252, 252, 168, 72, 18, 2;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+x)*P(n-1,x) for n >= 1, with P(0,x) = 2.
%t Mathematica
P[0, x_] := 2;
P[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 2; for(n = 1, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(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-3a144d1716c39a39
  • 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-07b4f7e7f8bd760f, e-2114c364938d0ed1, e-3a144d1716c39a39
  • 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-07b4f7e7f8bd760f, e-2114c364938d0ed1, e-3a144d1716c39a39
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-3a144d1716c39a39
  • 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-07b4f7e7f8bd760f, e-2114c364938d0ed1
  • Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, +inf) to roots in (-inf, +inf): every real-rooted input has a real-rooted image (an affine substitution times g)
    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-0f2818456c73ddce
  • Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, 1] to roots in (-inf, 0]: an input root r <= 1 gives the root (r - a)/d <= 0; a larger root gives a positive root
    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-0f2818456c73ddce

Proof chains

4 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 17 proof steps

Same fingerprint (59)

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