type_b_eulerian → γ

nonnegative coefficients

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

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
111
2145
312021
417280153
512329761209
617167664390412285
7121724977688640140589
81654429232012177923545601871217
91196641618656132016641293337627773361
10159028864387212478476827482035251733504460041525
111177124451082561080946304446993945627676313608363802501
1215314162319177448829655296618483811848408321843211070525440166064229513
131159429611808453606922895488076854715776019144895016968165825781763570030632169
1414782940597437582452711311712088553351564803643032767385633589447536640326633031270482674532955565

Generated b-files: A182825 (row sums), A333273 ?

Computed in your browser ?

Technical details
Node id
n-7b489708d21ffcfe · revision 1 · JSON
Definition source
derived:gamma_polynomial
Fingerprint
f6-f394a67368746b91

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,     4;
  3: 1,    20;
  4: 1,    72,      80;
  5: 1,   232,     976;
  6: 1,   716,    7664,     3904;
  7: 1,  2172,   49776,    88640;
  8: 1,  6544,  292320,  1217792,   354560;
  9: 1, 19664, 1618656, 13201664, 12933376;
%F Formula
The row polynomials satisfy P(n,x) = (1+(4*n-4)*x)*P(n-1,x) + (2*x-8*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 + (4*n - 4)*x)*P[n - 1, x] + (2*x - 8*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 + (4*n - 4)*x)*v[i - 1] + (2*x - 8*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.

A333273: triangle, offset 1, from the row P1
%e Example
Triangle begins:
   1: 1;
   2: 1,     4;
   3: 1,    20;
   4: 1,    72,      80;
   5: 1,   232,     976;
   6: 1,   716,    7664,      3904;
   7: 1,  2172,   49776,     88640;
   8: 1,  6544,  292320,   1217792,    354560;
   9: 1, 19664, 1618656,  13201664,  12933376;
  10: 1, 59028, 8643872, 124784768, 274820352, 51733504;
%F Formula
The row polynomials satisfy P(n,x) = (1+(4*n-4)*x)*P(n-1,x) + (2*x-8*x^2)*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[(1 + (4*n - 4)*x)*P[n - 1, x] + (2*x - 8*x^2)*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] = (1 + (4*n - 4)*x)*v[i - 1] + (2*x - 8*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, v[i])))};
T(10)

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-fcc9671b64420c56
  • 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-fcc9671b64420c56
  • 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-fcc9671b64420c56

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 (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