A008278 → θ+1

nonnegative coefficients

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

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2123
316310
411221438
512075605161
61301953601556747
71424201400150537873753
8156798420085055796889820253

Computed in your browser ?

Technical details
Node id
n-72c5806fd64716a2 · revision 1 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-9e6242213e8ef38e

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 ?

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: 1,  2;
   3: 1,  6,    3;
   4: 1, 12,   21,     4;
   5: 1, 20,   75,    60,      5;
   6: 1, 30,  195,   360,    155,      6;
   7: 1, 42,  420,  1400,   1505,    378,      7;
   8: 1, 56,  798,  4200,   8505,   5796,    889,     8;
   9: 1, 72, 1386, 10584,  34755,  46620,  21175,  2040,    9;
  10: 1, 90, 2250, 23520, 114135, 255150, 238735, 74640, 4599, 10;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = -(n+(2*n^2-4*n)*x+(n^3-3*n^2+2*n)*x^2)*P(n-2,x) + (n*x^2+(n^2-n)*x^3)*d/dx P(n-2,x) + (2*n-1+(2*n^2-4*n+2)*x)*P(n-1,x) - (n-1)*x^2*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + 2*x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 1 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n + (2*n^2 - 4*n)*x + (n^3 - 3*n^2 + 2*n)*x^2)*P[n - 2, x] + (n*x^2 + (n^2 - n)*x^3)*D[P[n - 2, x], x] + (2*n - 1 + (2*n^2 - 4*n + 2)*x)*P[n - 1, x] - (n - 1)*x^2*D[P[n - 1, x], x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 2*x; for(n = 3, N, my(i = n); v[i] = (-(n + (2*n^2 - 4*n)*x + (n^3 - 3*n^2 + 2*n)*x^2)*v[i - 2] + (n*x^2 + (n^2 - n)*x^3)*deriv(v[i - 2], x) + (2*n - 1 + (2*n^2 - 4*n + 2)*x)*v[i - 1] - (n - 1)*x^2*deriv(v[i - 1], x))/(n - 1)); 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 >= 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-162681880755ce3c
  • 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-162681880755ce3c
  • 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-162681880755ce3c
  • 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-162681880755ce3c

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

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

References

  1. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
  2. [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
  3. [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
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.