Real-rooted atlas

Riordan array (1-x,x/(1-x)).

A159854 (tail) palindromic γ-positive nonnegative coefficients only rational roots

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

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
00011
100112
2001214
30013318
4001464116
5001510105132
600161520156164
700172135352171128

Show all 15 stored rows

Generated b-files: A000079 (row sums), A007318, A007318 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-7717563017cb9e5f · revision 1 · JSON
Definition source
oeis_catalog:A159854
Fingerprint
f6-77a7ed3b1d5f257e

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 2)
  • 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: 0, 0, 1;
  1: 0, 0, 1, 1;
  2: 0, 0, 1, 2,  1;
  3: 0, 0, 1, 3,  3,  1;
  4: 0, 0, 1, 4,  6,  4,   1;
  5: 0, 0, 1, 5, 10, 10,   5,   1;
  6: 0, 0, 1, 6, 15, 20,  15,   6,  1;
  7: 0, 0, 1, 7, 21, 35,  35,  21,  7,  1;
  8: 0, 0, 1, 8, 28, 56,  70,  56, 28,  8, 1;
  9: 0, 0, 1, 9, 36, 84, 126, 126, 84, 36, 9, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) for n >= 1, with P(0,x) = x^2.
%t Mathematica
P[0, x_] := 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] = x^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.

A007318: triangle, offset 0, from the row P0, low zeros dropped
%e Example
Triangle begins:
  0: 1;
  1: 1, 1;
  2: 1, 2,  1;
  3: 1, 3,  3,  1;
  4: 1, 4,  6,  4,   1;
  5: 1, 5, 10, 10,   5,   1;
  6: 1, 6, 15, 20,  15,   6,  1;
  7: 1, 7, 21, 35,  35,  21,  7,  1;
  8: 1, 8, 28, 56,  70,  56, 28,  8, 1;
  9: 1, 9, 36, 84, 126, 126, 84, 36, 9, 1;
%F Formula
Row n lists the coefficients of P(n,x) in ascending powers of x, starting at the lowest nonzero coefficient, where P(n,x) = (1+x)*P(n-1,x) for n >= 1, with P(0,x) = x^2.
%t Mathematica
P[0, x_] := x^2;
P[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x]];
Table[PadRight[CoefficientList[Expand[P[n, x]/x^Exponent[P[n, x], x, Min]], x], n + 1], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = x^2; for(n = 1, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); 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.

A007318: reversed triangle, offset 0, from the row P0, low zeros dropped
%e Example
Triangle begins:
  0: 1;
  1: 1, 1;
  2: 1, 2,  1;
  3: 1, 3,  3,  1;
  4: 1, 4,  6,  4,   1;
  5: 1, 5, 10, 10,   5,   1;
  6: 1, 6, 15, 20,  15,   6,  1;
  7: 1, 7, 21, 35,  35,  21,  7,  1;
  8: 1, 8, 28, 56,  70,  56, 28,  8, 1;
  9: 1, 9, 36, 84, 126, 126, 84, 36, 9, 1;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, down to the lowest nonzero coefficient, where P(n,x) = (1+x)*P(n-1,x) for n >= 1, with P(0,x) = x^2.
%t Mathematica
P[0, x_] := x^2;
P[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x]];
Table[Reverse[PadRight[CoefficientList[Expand[P[n, x]/x^Exponent[P[n, x], x, Min]], x], n + 1]], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = x^2; for(n = 1, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); 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-b62074ba45057e82
  • 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-b62074ba45057e82
  • 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-b62074ba45057e82
  • 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-08a1e090b4e4ea0b
  • 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-08a1e090b4e4ea0b

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

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