A103327 → θ+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 - 2\,n + n x - 4\,n^{2} x + 4\,n^{3} x\right)\,P_{n}(x) = \left(-1 + 10\,x + 3\,x^{2} - 2\,n - 13\,n x - 13\,n x^{2} + 4\,n^{3} x + 12\,n^{3} x^{2}\right)\,P_{n-1}(x) + \left(-4\,x + 2\,x^{2} + 2\,x^{3} + 8\,n x^{2} - 8\,n x^{3} + 8\,n^{2} x^{2} - 8\,n^{2} x^{3}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1325
2520328
3770634144
491683781445704
5113301386132027563328
613572386168643575468715360
715910900925740250258190735869632
81713601856477792121550742561666010889311296
919193834884201552461890453492189924310081539101376256
1021266061047465120146965021162961424430434112538652100116029312
1123354210094798062840859508112468800846239225129085238855027831226214400
1225460015939019228001021487526744400364021002615008097341751771000139150360013113246208
132758502421903552120234341257822737014040810013907088075926565222007503256110210600456314486539264
142973083562656243120500750252075837404750474056204700804670634152003001004721359557002403087635684152080374784

Computed in your browser ?

Technical details
Node id
n-49a786e4275f4fae · revision 1 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-dbbfaec00ea58ed5

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

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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:  1;
  1:  3,    2;
  2:  5,   20,     3;
  3:  7,   70,    63,      4;
  4:  9,  168,   378,    144,      5;
  5: 11,  330,  1386,   1320,    275,      6;
  6: 13,  572,  3861,   6864,   3575,    468,      7;
  7: 15,  910,  9009,  25740,  25025,   8190,    735,     8;
  8: 17, 1360, 18564,  77792, 121550,  74256,  16660,  1088,    9;
  9: 19, 1938, 34884, 201552, 461890, 453492, 189924, 31008, 1539, 10;
%F Formula
The row polynomials satisfy -(2*n-1-(4*n^3-4*n^2+n)*x)*P(n,x) = -(2*n+1-(4*n^3-13*n+10)*x-(12*n^3-13*n+3)*x^2)*P(n-1,x) - (4*x-(8*n^2+8*n+2)*x^2+(8*n^2+8*n-2)*x^3)*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[Together[(-(2*n + 1 - (4*n^3 - 13*n + 10)*x - (12*n^3 - 13*n + 3)*x^2)*P[n - 1, x] - (4*x - (8*n^2 + 8*n + 2)*x^2 + (8*n^2 + 8*n - 2)*x^3)*D[P[n - 1, x], x])/(-2*n + 1 + (4*n^3 - 4*n^2 + n)*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] = (-(2*n + 1 - (4*n^3 - 13*n + 10)*x - (12*n^3 - 13*n + 3)*x^2)*v[i - 1] - (4*x - (8*n^2 + 8*n + 2)*x^2 + (8*n^2 + 8*n - 2)*x^3)*deriv(v[i - 1], x))/(-2*n + 1 + (4*n^3 - 4*n^2 + n)*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-5eacdf1805a7ca9d
  • 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-5eacdf1805a7ca9d
  • 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-5eacdf1805a7ca9d
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-5eacdf1805a7ca9d

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