Real-rooted atlas

A048993: Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 0 <= k <= n.

A106800 → reverse (shift +1)

A048993 nonnegative coefficients

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

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1011
20112
301315
40176115
501152510152
601319065151203
70163301350140211877

Show all 15 stored rows

Generated b-files: A000110 (row sums), A008277, A008278 (reversed triangle), A048993, A106800 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-e65f982fa1b436c5 · revision 1 · JSON
Definition source
oeis_catalog:A048993
Fingerprint
f6-4732d0911d5a78c5

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 ℚ): 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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 0, 1;
  2: 0, 1,   1;
  3: 0, 1,   3,    1;
  4: 0, 1,   7,    6,    1;
  5: 0, 1,  15,   25,   10,    1;
  6: 0, 1,  31,   90,   65,   15,    1;
  7: 0, 1,  63,  301,  350,  140,   21,   1;
  8: 0, 1, 127,  966, 1701, 1050,  266,  28,  1;
  9: 0, 1, 255, 3025, 7770, 6951, 2646, 462, 36, 1;
%F Formula
The row polynomials satisfy P(n,x) = x*P(n-1,x) + x*d/dx 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[x*P[n - 1, x] + x*D[P[n - 1, x], 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] = 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 - 1, v[i])))};
T(9)

Generated with polytool c48629374597.

A008277: triangle, offset 1, from the row P1, low zeros dropped
%e Example
Triangle begins:
   1: 1;
   2: 1,   1;
   3: 1,   3,    1;
   4: 1,   7,    6,     1;
   5: 1,  15,   25,    10,     1;
   6: 1,  31,   90,    65,    15,     1;
   7: 1,  63,  301,   350,   140,    21,    1;
   8: 1, 127,  966,  1701,  1050,   266,   28,   1;
   9: 1, 255, 3025,  7770,  6951,  2646,  462,  36,  1;
  10: 1, 511, 9330, 34105, 42525, 22827, 5880, 750, 45, 1;
%F Formula
Row n lists the coefficients of P(n,x) in ascending powers of x, starting at the lowest nonzero coefficient, where P(n,x) = x*P(n-1,x) + x*d/dx P(n-1,x) for n >= 2, with P(1,x) = x.
%t Mathematica
P[1, x_] := x;
P[n_, x_] := P[n, x] = Expand[x*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[PadRight[CoefficientList[Expand[P[n, x]/x^Exponent[P[n, x], x, Min]], x], n], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = x; for(n = 2, N, my(i = n); v[i] = x*v[i - 1] + x*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); c = concat(c, vector(n - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Generated with polytool c48629374597.

A008278: reversed triangle, offset 1, from the row P1, low zeros dropped
%e Example
Triangle begins:
   1: 1;
   2: 1,  1;
   3: 1,  3,   1;
   4: 1,  6,   7,    1;
   5: 1, 10,  25,   15,     1;
   6: 1, 15,  65,   90,    31,     1;
   7: 1, 21, 140,  350,   301,    63,     1;
   8: 1, 28, 266, 1050,  1701,   966,   127,    1;
   9: 1, 36, 462, 2646,  6951,  7770,  3025,  255,   1;
  10: 1, 45, 750, 5880, 22827, 42525, 34105, 9330, 511, 1;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, down to the lowest nonzero coefficient, where P(n,x) = x*P(n-1,x) + x*d/dx P(n-1,x) for n >= 2, with P(1,x) = x.
%t Mathematica
P[1, x_] := x;
P[n_, x_] := P[n, x] = Expand[x*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[Reverse[PadRight[CoefficientList[Expand[P[n, x]/x^Exponent[P[n, x], x, Min]], x], n]], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = x; for(n = 2, N, my(i = n); v[i] = x*v[i - 1] + x*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); c = concat(c, vector(n - #c)); c = Vecrev(c); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Generated with polytool c48629374597.

A048993: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0: 1;
  1: 0, 1;
  2: 0, 1,   1;
  3: 0, 1,   3,    1;
  4: 0, 1,   7,    6,    1;
  5: 0, 1,  15,   25,   10,    1;
  6: 0, 1,  31,   90,   65,   15,    1;
  7: 0, 1,  63,  301,  350,  140,   21,   1;
  8: 0, 1, 127,  966, 1701, 1050,  266,  28,  1;
  9: 0, 1, 255, 3025, 7770, 6951, 2646, 462, 36, 1;
%F Formula
The row polynomials satisfy P(n,x) = x*P(n-1,x) + x*d/dx 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[x*P[n - 1, x] + x*D[P[n - 1, x], 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] = x*v[i - 1] + x*deriv(v[i - 1], x)); 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.

A106800: reversed triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0: 1;
  1: 1,  0;
  2: 1,  1,   0;
  3: 1,  3,   1,    0;
  4: 1,  6,   7,    1,    0;
  5: 1, 10,  25,   15,    1,    0;
  6: 1, 15,  65,   90,   31,    1,    0;
  7: 1, 21, 140,  350,  301,   63,    1,   0;
  8: 1, 28, 266, 1050, 1701,  966,  127,   1, 0;
  9: 1, 36, 462, 2646, 6951, 7770, 3025, 255, 1, 0;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = x*P(n-1,x) + x*d/dx 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[x*P[n - 1, x] + x*D[P[n - 1, x], 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] = x*v[i - 1] + x*deriv(v[i - 1], x)); 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-857a86cbb6c7881e, e-ad13a5d17ca116d8
  • 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-857a86cbb6c7881e, e-ad13a5d17ca116d8
  • 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-857a86cbb6c7881e, e-ad13a5d17ca116d8

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

Same fingerprint (11)

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
  5. [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