Real-rooted atlas

A027465: Cube of lower triangular normalized binomial matrix.

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1314
296116
327279164
48110854121256
5243405270901511024
6729145812155401351814096
7218751035103283594518921116384
865611749620412136085670151225224165536
91968359049787326123630618102062268324271262144
1059049196830295245262440153090612361701032404053011048576
11177147649539108256510825657217103367981122662673044554953314194304
125314412125764389723443302603247695173210467359619245640095594059436116777216
131594323690873313817466168880141407334584440073752892125096431274157915772270239167108864
14478296922320522483611316448150859108049394053661970268375057842189187486486810819828819421268435456

Generated b-files: A000302 (row sums), A013610 (reversed triangle), A027465 ?

Computed in your browser ?

Technical details
Node id
n-8d887bfc40d036b9 · revision 3 · JSON
Definition source
oeis_catalog:A027465
Fingerprint
f6-f9762973ec1089d7

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:     3,     1;
  2:     9,     6,     1;
  3:    27,    27,     9,     1;
  4:    81,   108,    54,    12,     1;
  5:   243,   405,   270,    90,    15,     1;
  6:   729,  1458,  1215,   540,   135,    18,    1;
  7:  2187,  5103,  5103,  2835,   945,   189,   21,   1;
  8:  6561, 17496, 20412, 13608,  5670,  1512,  252,  24,  1;
  9: 19683, 59049, 78732, 61236, 30618, 10206, 2268, 324, 27, 1;
%F Formula
The row polynomials satisfy P(n,x) = (3+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[(3 + 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] = (3 + 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.

A013610: reversed triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0: 1;
  1: 1,  3;
  2: 1,  6,   9;
  3: 1,  9,  27,   27;
  4: 1, 12,  54,  108,    81;
  5: 1, 15,  90,  270,   405,   243;
  6: 1, 18, 135,  540,  1215,  1458,   729;
  7: 1, 21, 189,  945,  2835,  5103,  5103,  2187;
  8: 1, 24, 252, 1512,  5670, 13608, 20412, 17496,  6561;
  9: 1, 27, 324, 2268, 10206, 30618, 61236, 78732, 59049, 19683;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (3+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[(3 + 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] = (3 + 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.

A027465: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0:     1;
  1:     3,     1;
  2:     9,     6,     1;
  3:    27,    27,     9,     1;
  4:    81,   108,    54,    12,     1;
  5:   243,   405,   270,    90,    15,     1;
  6:   729,  1458,  1215,   540,   135,    18,    1;
  7:  2187,  5103,  5103,  2835,   945,   189,   21,   1;
  8:  6561, 17496, 20412, 13608,  5670,  1512,  252,  24,  1;
  9: 19683, 59049, 78732, 61236, 30618, 10206, 2268, 324, 27, 1;
%F Formula
The row polynomials satisfy P(n,x) = (3+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[(3 + 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] = (3 + 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-2786234a932620b2
  • 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-090c65763405a203, e-2786234a932620b2, e-4b09f87a5a93f62b, e-58678fea8a24dd74, e-7b97c40e19745577
  • 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-090c65763405a203, e-2786234a932620b2, e-4b09f87a5a93f62b, e-58678fea8a24dd74, e-7b97c40e19745577
  • 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-2786234a932620b2
  • 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-090c65763405a203, e-58678fea8a24dd74, e-7b97c40e19745577
  • 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-72ff8ab34d4573c3
  • Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, 3] to roots in (-inf, 0]: an input root r <= 3 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-72ff8ab34d4573c3
  • 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-4b09f87a5a93f62b
  • 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-4b09f87a5a93f62b

Proof chains

6 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 16 proof steps

Same fingerprint (16)

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