Real-rooted atlas

A143495: Triangle read by rows: 3-Stirling numbers of the second kind.

A143495 nonnegative coefficients

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

Recurrence from OEIS A143495
\(P_{n}(x) = \left(3 + x\right)\,P_{n-1}(x) + \left(x\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2314
397117
4273712177
58117597181372
62437816602052511915
772933674081189038033110481
82187141972377215421455064442160814
96561589751330571162984727197021022521372939
10196832424617242608308454471951248871890015426312409837
1159049989527386376157093303961210144629129498734320223575116360786
121771474017157203083323811974133437800155315384101174638187589053135881116393205
1353144116245775105558817249026778272184341157690104524421041048304412861429652542791021865549453
14159432365514541544039860159971948521543171651533705173629669040157272544246306062444442152152570711716713065156
1547829692636524872785713841101423567701667993964014423958549720072653322023944804282092105396391044224182320507462133154190360453

Generated b-files: A005494 (row sums), A143495 ?

Computed in your browser ?

Technical details
Node id
n-a2b8ff03da0c14a3 · revision 2 · JSON
Definition source
oeis_catalog:A143495
Fingerprint
f6-322b0642acfc2857

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 -1)
  • 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 ℚ): no

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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:     1;
   2:     3,      1;
   3:     9,      7,      1;
   4:    27,     37,     12,      1;
   5:    81,    175,     97,     18,      1;
   6:   243,    781,    660,    205,     25,      1;
   7:   729,   3367,   4081,   1890,    380,     33,     1;
   8:  2187,  14197,  23772,  15421,   4550,    644,    42,    1;
   9:  6561,  58975, 133057, 116298,  47271,   9702,  1022,   52,  1;
  10: 19683, 242461, 724260, 830845, 447195, 124887, 18900, 1542, 63, 1;
%F Formula
The row polynomials satisfy P(n,x) = (3+x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(3 + x)*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (3 + x)*v[i - 1] + x*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Generated with polytool c48629374597.

A143495: triangle, offset 3, from the row P1
%e Example
Triangle begins:
   3:     1;
   4:     3,      1;
   5:     9,      7,      1;
   6:    27,     37,     12,      1;
   7:    81,    175,     97,     18,      1;
   8:   243,    781,    660,    205,     25,      1;
   9:   729,   3367,   4081,   1890,    380,     33,     1;
  10:  2187,  14197,  23772,  15421,   4550,    644,    42,    1;
  11:  6561,  58975, 133057, 116298,  47271,   9702,  1022,   52,  1;
  12: 19683, 242461, 724260, 830845, 447195, 124887, 18900, 1542, 63, 1;
%F Formula
The row polynomials satisfy P(n,x) = (3+x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 4, with P(3,x) = 1.
%t Mathematica
P[3, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(3 + x)*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[PadRight[CoefficientList[P[n, x], x], n - 2], {n, 3, 12}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N - 2)); v[1] = 1; for(n = 4, N, my(i = n - 2); v[i] = (3 + x)*v[i - 1] + x*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - 2 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i + 2, v[i])))};
T(12)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 1, 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-4d8fac6359540276
  • Coefficients of one sign. Every nonzero row, n >= 1: 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-4d8fac6359540276, e-95a6a1104a7cd304
  • Hadamard kernel (Malo). Rows P_n, n >= 1, 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-4d8fac6359540276, e-95a6a1104a7cd304
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 2
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-4d8fac6359540276
  • Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, 3] to roots in (-inf, 0]: source (-inf, a + b h + kappa m] = (-inf, 3] with m = 0, target (-inf, 0]
    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-5a54a7c441e719b3
  • Real-rooted. Every row P_n, n >= 1, 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-95a6a1104a7cd304
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-95a6a1104a7cd304

Proof chains

3 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 9 proof steps

Same fingerprint (3)

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

References

  1. [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
  2. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.