Real-rooted atlas

A008971: Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.

type_b_eulerian → γ (scale 1/4)

A008971 nonnegative coefficients

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

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
111
2112
3156
4118524
515861120
6117947961720
71543311113855040
8116361827019028138540320
91491610116620627650521362880
1011475754024219497621073517505213628800
1114428128192661688978617460701270276539916800
12113285414494859137963364241595239821125182702765479001600
131398574738028351081702420300213733518696186541993609816227020800
141119573537339848982361424553459115295535576491869820054871519936098187178291200

Generated b-files: A000142 (row sums), A008971 ?

Computed in your browser ?

Technical details
Node id
n-5e3f8ad0b0a35d3e · revision 1 · JSON
Definition source
oeis_catalog:A008971
Fingerprint
f6-efa00b2a69da6c9b

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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: 1;
  2: 1,    1;
  3: 1,    5;
  4: 1,   18,      5;
  5: 1,   58,     61;
  6: 1,  179,    479,     61;
  7: 1,  543,   3111,   1385;
  8: 1, 1636,  18270,  19028,  1385;
  9: 1, 4916, 101166, 206276, 50521;
%F Formula
The row polynomials satisfy P(n,x) = (1+(n-1)*x)*P(n-1,x) + (2*x-2*x^2)*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[(1 + (n - 1)*x)*P[n - 1, x] + (2*x - 2*x^2)*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] = (1 + (n - 1)*x)*v[i - 1] + (2*x - 2*x^2)*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.

A008971: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0: 1;
  1: 1;
  2: 1,    1;
  3: 1,    5;
  4: 1,   18,      5;
  5: 1,   58,     61;
  6: 1,  179,    479,     61;
  7: 1,  543,   3111,   1385;
  8: 1, 1636,  18270,  19028,  1385;
  9: 1, 4916, 101166, 206276, 50521;
%F Formula
The row polynomials satisfy P(n,x) = (1+(n-1)*x)*P(n-1,x) + (2*x-2*x^2)*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[(1 + (n - 1)*x)*P[n - 1, x] + (2*x - 2*x^2)*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] = (1 + (n - 1)*x)*v[i - 1] + (2*x - 2*x^2)*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.

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-4c46966ead0b055f
  • 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-4c46966ead0b055f
  • 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-4c46966ead0b055f

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

Used in 5 proof steps

No candidate equalities or related sequences.

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