Real-rooted atlas

A082985 → (θ+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(2\,n x - 4\,n^{2} - 4\,n^{2} x - 4\,n^{2} x^{2} + 8\,n^{3} - 24\,n^{3} x - 8\,n^{3} x^{2} + 48\,n^{4} x + 16\,n^{4} x^{2} + 32\,n^{5} x^{2}\right)\,P_{n}(x) = \left(-4\,x^{2} - 4\,x^{3} + 2\,n x + 16\,n x^{2} - 24\,n x^{3} - 4\,n^{2} - 52\,n^{2} x - 168\,n^{2} x^{2} - 108\,n^{2} x^{3} + 8\,n^{3} + 72\,n^{3} x + 168\,n^{3} x^{2} + 168\,n^{3} x^{3} + 48\,n^{4} x + 256\,n^{4} x^{2} + 304\,n^{4} x^{3} + 32\,n^{5} x^{2} + 96\,n^{5} x^{3}\right)\,P_{n-1}(x) + \left(-x^{2} - 6\,x^{3} - 8\,x^{4} - 2\,n x^{2} - 24\,n x^{3} - 64\,n x^{4} - 4\,n^{2} x - 52\,n^{2} x^{2} - 212\,n^{2} x^{3} - 272\,n^{2} x^{4} - 24\,n^{3} x^{2} - 160\,n^{3} x^{3} - 256\,n^{3} x^{4} - 16\,n^{4} x^{3} - 64\,n^{4} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
111213
21204566
3128126112267
4136243480225985
5144396123213753963444
615258524964550327663711597
716081044001125013608686096037949

Show all 15 stored rows

Computed in your browser ?

Technical details
Node id
n-bbda111424d81fcc · revision 1 · JSON
Definition source
derived:theta_plus_one_squared
Fingerprint
f6-f275e5e9925d5c1c

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: 1, 12;
  2: 1, 20,   45;
  3: 1, 28,  126,   112;
  4: 1, 36,  243,   480,   225;
  5: 1, 44,  396,  1232,  1375,   396;
  6: 1, 52,  585,  2496,  4550,  3276,    637;
  7: 1, 60,  810,  4400, 11250, 13608,   6860,   960;
  8: 1, 68, 1071,  7072, 23375, 40392,  34986, 13056,  1377;
  9: 1, 76, 1368, 10640, 43225, 97812, 122892, 80256, 23085, 1900;
%F Formula
The row polynomials satisfy (8*n^3-4*n^2+(48*n^4-24*n^3-4*n^2+2*n)*x+(32*n^5+16*n^4-8*n^3-4*n^2)*x^2)*P(n,x) = (8*n^3-4*n^2+(48*n^4+72*n^3-52*n^2+2*n)*x+(32*n^5+256*n^4+168*n^3-168*n^2+16*n-4)*x^2+(96*n^5+304*n^4+168*n^3-108*n^2-24*n-4)*x^3)*P(n-1,x) - (4*n^2*x+(24*n^3+52*n^2+2*n+1)*x^2+(16*n^4+160*n^3+212*n^2+24*n+6)*x^3+(64*n^4+256*n^3+272*n^2+64*n+8)*x^4)*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[((8*n^3 - 4*n^2 + (48*n^4 + 72*n^3 - 52*n^2 + 2*n)*x + (32*n^5 + 256*n^4 + 168*n^3 - 168*n^2 + 16*n - 4)*x^2 + (96*n^5 + 304*n^4 + 168*n^3 - 108*n^2 - 24*n - 4)*x^3)*P[n - 1, x] - (4*n^2*x + (24*n^3 + 52*n^2 + 2*n + 1)*x^2 + (16*n^4 + 160*n^3 + 212*n^2 + 24*n + 6)*x^3 + (64*n^4 + 256*n^3 + 272*n^2 + 64*n + 8)*x^4)*D[P[n - 1, x], x])/(8*n^3 - 4*n^2 + (48*n^4 - 24*n^3 - 4*n^2 + 2*n)*x + (32*n^5 + 16*n^4 - 8*n^3 - 4*n^2)*x^2)]];
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] = ((8*n^3 - 4*n^2 + (48*n^4 + 72*n^3 - 52*n^2 + 2*n)*x + (32*n^5 + 256*n^4 + 168*n^3 - 168*n^2 + 16*n - 4)*x^2 + (96*n^5 + 304*n^4 + 168*n^3 - 108*n^2 - 24*n - 4)*x^3)*v[i - 1] - (4*n^2*x + (24*n^3 + 52*n^2 + 2*n + 1)*x^2 + (16*n^4 + 160*n^3 + 212*n^2 + 24*n + 6)*x^3 + (64*n^4 + 256*n^3 + 272*n^2 + 64*n + 8)*x^4)*deriv(v[i - 1], x))/(8*n^3 - 4*n^2 + (48*n^4 - 24*n^3 - 4*n^2 + 2*n)*x + (32*n^5 + 16*n^4 - 8*n^3 - 4*n^2)*x^2)); 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-1c39fb0703d12b2d
  • 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-1c39fb0703d12b2d
  • 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-1c39fb0703d12b2d
  • 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-1c39fb0703d12b2d

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