Real-rooted atlas

A013622 → basis A013609

nonnegative coefficients only rational roots

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

Recurrence
\(P_{n}(x) = \left(8 + 10\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
181018
264160100324
35121920240010005832
4409620480384003200010000104976
5327682048005120006400004000001000001889568
6262144196608061440001024000096000004800000100000034012224
7209715218350080688128001433600001792000001344000005600000010000000612220032

Show all 15 stored rows

Generated b-files: A001027 (row sums), A038288, A038310 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-09320ea6fe78bcb6 · revision 1 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-6b726760bd05165a

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:         8,         10;
  2:        64,        160,        100;
  3:       512,       1920,       2400,        1000;
  4:      4096,      20480,      38400,       32000,       10000;
  5:     32768,     204800,     512000,      640000,      400000,      100000;
  6:    262144,    1966080,    6144000,    10240000,     9600000,     4800000,     1000000;
  7:   2097152,   18350080,   68812800,   143360000,   179200000,   134400000,    56000000,    10000000;
  8:  16777216,  167772160,  734003200,  1835008000,  2867200000,  2867200000,  1792000000,   640000000,  100000000;
  9: 134217728, 1509949440, 7549747200, 22020096000, 41287680000, 51609600000, 43008000000, 23040000000, 7200000000, 1000000000;
%F Formula
The row polynomials satisfy P(n,x) = (8+10*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[(8 + 10*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] = (8 + 10*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.

A038288: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0:         1;
  1:         8,         10;
  2:        64,        160,        100;
  3:       512,       1920,       2400,        1000;
  4:      4096,      20480,      38400,       32000,       10000;
  5:     32768,     204800,     512000,      640000,      400000,      100000;
  6:    262144,    1966080,    6144000,    10240000,     9600000,     4800000,     1000000;
  7:   2097152,   18350080,   68812800,   143360000,   179200000,   134400000,    56000000,    10000000;
  8:  16777216,  167772160,  734003200,  1835008000,  2867200000,  2867200000,  1792000000,   640000000,  100000000;
  9: 134217728, 1509949440, 7549747200, 22020096000, 41287680000, 51609600000, 43008000000, 23040000000, 7200000000, 1000000000;
%F Formula
The row polynomials satisfy P(n,x) = (8+10*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[(8 + 10*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] = (8 + 10*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.

A038310: reversed triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0:          1;
  1:         10,          8;
  2:        100,        160,          64;
  3:       1000,       2400,        1920,         512;
  4:      10000,      32000,       38400,       20480,        4096;
  5:     100000,     400000,      640000,      512000,      204800,       32768;
  6:    1000000,    4800000,     9600000,    10240000,     6144000,     1966080,      262144;
  7:   10000000,   56000000,   134400000,   179200000,   143360000,    68812800,    18350080,    2097152;
  8:  100000000,  640000000,  1792000000,  2867200000,  2867200000,  1835008000,   734003200,  167772160,   16777216;
  9: 1000000000, 7200000000, 23040000000, 43008000000, 51609600000, 41287680000, 22020096000, 7549747200, 1509949440, 134217728;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (8+10*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[(8 + 10*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] = (8 + 10*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-c5caeaebd0a50686
  • 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-c5caeaebd0a50686
  • 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-c5caeaebd0a50686

Proof chains

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

Same fingerprint (6)

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