Real-rooted atlas

A038243: Triangle whose (i,j)-th entry is 5^(i-j)*binomial(i,j).

A038243 nonnegative coefficients only rational roots

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

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1516
22510136
312575151216
46255001502011296
53125312512502502517776
615625187509375250037530146656
77812510937565625218754375525351279936

Show all 15 stored rows

Generated b-files: A000400 (row sums), A013612 (reversed triangle), A038243 ?

Computed in your browser ?

Technical details
Node id
n-7b91a7a037fb3513 · revision 3 · JSON
Definition source
oeis_catalog:A038243
Fingerprint
f6-a8e18dd2f0709b33

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 ℚ): 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:       1;
  1:       5,       1;
  2:      25,      10,       1;
  3:     125,      75,      15,       1;
  4:     625,     500,     150,      20,      1;
  5:    3125,    3125,    1250,     250,     25,     1;
  6:   15625,   18750,    9375,    2500,    375,    30,     1;
  7:   78125,  109375,   65625,   21875,   4375,   525,    35,   1;
  8:  390625,  625000,  437500,  175000,  43750,  7000,   700,  40,  1;
  9: 1953125, 3515625, 2812500, 1312500, 393750, 78750, 10500, 900, 45, 1;
%F Formula
The row polynomials satisfy P(n,x) = (5+x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(5 + 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; for(n = 1, N, my(i = n + 1); v[i] = (5 + 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.

A013612: reversed triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0: 1;
  1: 1,  5;
  2: 1, 10,  25;
  3: 1, 15,  75,   125;
  4: 1, 20, 150,   500,   625;
  5: 1, 25, 250,  1250,  3125,   3125;
  6: 1, 30, 375,  2500,  9375,  18750,   15625;
  7: 1, 35, 525,  4375, 21875,  65625,  109375,   78125;
  8: 1, 40, 700,  7000, 43750, 175000,  437500,  625000,  390625;
  9: 1, 45, 900, 10500, 78750, 393750, 1312500, 2812500, 3515625, 1953125;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (5+x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(5 + 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] = 1; for(n = 1, N, my(i = n + 1); v[i] = (5 + 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.

A038243: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0:       1;
  1:       5,       1;
  2:      25,      10,       1;
  3:     125,      75,      15,       1;
  4:     625,     500,     150,      20,      1;
  5:    3125,    3125,    1250,     250,     25,     1;
  6:   15625,   18750,    9375,    2500,    375,    30,     1;
  7:   78125,  109375,   65625,   21875,   4375,   525,    35,   1;
  8:  390625,  625000,  437500,  175000,  43750,  7000,   700,  40,  1;
  9: 1953125, 3515625, 2812500, 1312500, 393750, 78750, 10500, 900, 45, 1;
%F Formula
The row polynomials satisfy P(n,x) = (5+x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(5 + 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] = 1; for(n = 1, N, my(i = n + 1); v[i] = (5 + 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.

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-f2f89dae9298aff8
  • 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-0ab1d5f59b4d29a0, e-868f364735375874, e-8f220a12633250f0, e-f2f89dae9298aff8
  • 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-0ab1d5f59b4d29a0, e-868f364735375874, e-8f220a12633250f0, e-f2f89dae9298aff8
  • 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-f2f89dae9298aff8
  • 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-868f364735375874, e-8f220a12633250f0
  • 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-f12c666736870d38
  • Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, 5] to roots in (-inf, 0]: an input root r <= 5 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-f12c666736870d38
  • Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-0ab1d5f59b4d29a0
  • 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-0ab1d5f59b4d29a0

Proof chains

5 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 7 proof steps

Same fingerprint (5)

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

References

  1. [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
  2. [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
  3. [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
  4. [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