Real-rooted atlas

Riordan array ((1+x)^3,x).

A122431 (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 A122431
\(P_{n}(x) = \left(x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1 + 3\,x + 3\,x^{2} + x^{3}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10Pn(1)
013318
1013318
20013318
300013318
4000013318
50000013318
600000013318
7000000013318

Show all 15 stored rows

Computed in your browser ?

Technical details
Node id
n-e1d160f3b707da31 · revision 1 · JSON
Definition source
oeis_catalog:A122431
Fingerprint
f6-5659ab0d98136444

Observed on the stored rows ?

  • Degrees: 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17 (affine: slope 1, intercept 3)
  • 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 ?

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: 1, 3, 3, 1;
  1: 0, 1, 3, 3, 1;
  2: 0, 0, 1, 3, 3, 1;
  3: 0, 0, 0, 1, 3, 3, 1;
  4: 0, 0, 0, 0, 1, 3, 3, 1;
  5: 0, 0, 0, 0, 0, 1, 3, 3, 1;
  6: 0, 0, 0, 0, 0, 0, 1, 3, 3, 1;
  7: 0, 0, 0, 0, 0, 0, 0, 1, 3, 3, 1;
  8: 0, 0, 0, 0, 0, 0, 0, 0, 1, 3, 3, 1;
  9: 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 3, 3, 1;
%F Formula
The row polynomials satisfy P(n,x) = x*P(n-1,x) for n >= 1, with P(0,x) = 1 + 3*x + 3*x^2 + x^3.
%t Mathematica
P[0, x_] := 1 + 3*x + 3*x^2 + x^3;
P[n_, x_] := P[n, x] = Expand[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] = 1 + 3*x + 3*x^2 + x^3; for(n = 1, N, my(i = n + 1); v[i] = 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.

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-73f8c6c9e8d957af
  • 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-73f8c6c9e8d957af
  • 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-73f8c6c9e8d957af
  • 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-468701cdcc848e53
  • Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, 0] to roots in (-inf, 0]: an input root r <= 0 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-468701cdcc848e53

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.