A091042 → D

palindromic γ-positive nonnegative coefficients

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

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

Rows ?

nx0x1x2x3x4x5x6Pn(1)
10
233
3101020
4217021112
53625225236576
6556601386660552816
77814305148514814307813312
81052730150152574015015273010561440

Computed in your browser ?

Technical details
Node id
n-4d3e16a521a9f879 · revision 1 · JSON
Definition source
derived:derivative
Fingerprint
f6-722f205416540a1b

Observed on the stored rows ?

  • Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (affine: slope 1, intercept -2)
  • Palindromic rows: yes
  • γ-positive (gamma_positive): yes
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): no

OEIS matches ?

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:   0;
   2:   3;
   3:  10,   10;
   4:  21,   70,    21;
   5:  36,  252,   252,     36;
   6:  55,  660,  1386,    660,     55;
   7:  78, 1430,  5148,   5148,   1430,     78;
   8: 105, 2730, 15015,  25740,  15015,   2730,   105;
   9: 136, 4760, 37128,  97240,  97240,  37128,  4760,  136;
  10: 171, 7752, 81396, 302328, 461890, 302328, 81396, 7752, 171;
%F Formula
The row polynomials satisfy (2*n^2-7*n+6)*P(n,x) = (2*n^2-3*n+1+(6*n^2-17*n+7)*x)*P(n-1,x) + ((4*n-2)*x-(4*n-2)*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 3.
%t Mathematica
P[1, x_] := 0;
P[2, x_] := 3;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^2 - 3*n + 1 + (6*n^2 - 17*n + 7)*x)*P[n - 1, x] + ((4*n - 2)*x - (4*n - 2)*x^2)*D[P[n - 1, x], x])/(2*n^2 - 7*n + 6)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 0; v[2] = 3; for(n = 3, N, my(i = n); v[i] = ((2*n^2 - 3*n + 1 + (6*n^2 - 17*n + 7)*x)*v[i - 1] + ((4*n - 2)*x - (4*n - 2)*x^2)*deriv(v[i - 1], x))/(2*n^2 - 7*n + 6)); 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-a74cab5e1bf19446
  • 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-a74cab5e1bf19446
  • 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-a74cab5e1bf19446
  • 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-a74cab5e1bf19446

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

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

References

  1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
  2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
  3. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023