A091042 → θ+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(9 - 3\,x - 6\,n + 11\,n x - 12\,n^{2} x + 4\,n^{3} x\right)\,P_{n}(x) = \left(9 + 51\,x + 12\,x^{2} - 6\,n - 25\,n x - 5\,n x^{2} - 12\,n^{2} x - 20\,n^{2} x^{2} + 4\,n^{3} x + 12\,n^{3} x^{2}\right)\,P_{n-1}(x) + \left(-12\,x + 6\,x^{2} + 6\,x^{3} + 8\,n^{2} x^{2} - 8\,n^{2} x^{3}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2167
31201536
414210528176
517237833645832
611109901848825663840
7115621456864643517169117408
812104095200203217518018318512077824
91272714049504121550116688433165440153344064
101342116281085283779105542683527169302487211901507328
11142017955217056101745021162962057510930240183141133002316553600
12150626565403788245157068643969464546653752022064133364901948127628311552
13160037950708400540787519612560364021003565920018386775480700058443027600325121634816
141702526501184040111003755061771012168702016046640011734105546868250976833096876038025378520093696
15181271253190008021460725120180060363271545620470080610775235345972900110165055187293601543815511564352214592512

Computed in your browser ?

Technical details
Node id
n-b82f6f873918cdd2 · revision 1 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-d402ff27ba37b944

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 ?

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,   6;
   3: 1,  20,    15;
   4: 1,  42,   105,     28;
   5: 1,  72,   378,    336,     45;
   6: 1, 110,   990,   1848,    825,     66;
   7: 1, 156,  2145,   6864,   6435,   1716,     91;
   8: 1, 210,  4095,  20020,  32175,  18018,   3185,   120;
   9: 1, 272,  7140,  49504, 121550, 116688,  43316,  5440,  153;
  10: 1, 342, 11628, 108528, 377910, 554268, 352716, 93024, 8721, 190;
%F Formula
The row polynomials satisfy -(6*n-9-(4*n^3-12*n^2+11*n-3)*x)*P(n,x) = -(6*n-9-(4*n^3-12*n^2-25*n+51)*x-(12*n^3-20*n^2-5*n+12)*x^2)*P(n-1,x) - (12*x-(8*n^2+6)*x^2+(8*n^2-6)*x^3)*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[Together[(-(6*n - 9 - (4*n^3 - 12*n^2 - 25*n + 51)*x - (12*n^3 - 20*n^2 - 5*n + 12)*x^2)*P[n - 1, x] - (12*x - (8*n^2 + 6)*x^2 + (8*n^2 - 6)*x^3)*D[P[n - 1, x], x])/(-6*n + 9 + (4*n^3 - 12*n^2 + 11*n - 3)*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] = (-(6*n - 9 - (4*n^3 - 12*n^2 - 25*n + 51)*x - (12*n^3 - 20*n^2 - 5*n + 12)*x^2)*v[i - 1] - (12*x - (8*n^2 + 6)*x^2 + (8*n^2 - 6)*x^3)*deriv(v[i - 1], x))/(-6*n + 9 + (4*n^3 - 12*n^2 + 11*n - 3)*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 >= 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-1081279861cd2a9c
  • 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-1081279861cd2a9c
  • 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-1081279861cd2a9c
  • 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-1081279861cd2a9c

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

No candidate equalities or related sequences.

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