A172431 → θ+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 + 4\,n^{2} + 4\,n^{2} x + 8\,n^{3} x\right)\,P_{n}(x) = \left(-4\,x - 4\,x^{2} + 2\,n + 4\,n x - 8\,n x^{2} + 4\,n^{2} + 28\,n^{2} x + 36\,n^{2} x^{2} + 8\,n^{3} x + 24\,n^{3} x^{2}\right)\,P_{n-1}(x) + \left(-x - 6\,x^{2} - 8\,x^{3} - 2\,n x - 16\,n x^{2} - 32\,n x^{3} - 4\,n^{2} x^{2} - 16\,n^{2} x^{3}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1145
218918
3112301659
4116638025185
512010822417536564
6124165480630336491685
712823488016501512588644957
813231514563575475232349608114406
91364082240682512012120126336148510041455
10140513326411900262083503527456115832200121118321
1114463045601938051408866329152057915200203146144335400
1214875961602992593024189924254592218790114400330334368169945193
131529008096442751580043798486201606802384862002139285241659151962650229
141561053104006325025502470662913643521831410167960010161583818888044478402257398330

Computed in your browser ?

Technical details
Node id
n-68ad8eba8fb6df33 · revision 1 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-c7722c8666024957

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 ?

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,  4;
  2: 1,  8,   9;
  3: 1, 12,  30,   16;
  4: 1, 16,  63,   80,   25;
  5: 1, 20, 108,  224,  175,    36;
  6: 1, 24, 165,  480,  630,   336,    49;
  7: 1, 28, 234,  880, 1650,  1512,   588,   64;
  8: 1, 32, 315, 1456, 3575,  4752,  3234,  960,   81;
  9: 1, 36, 408, 2240, 6825, 12012, 12012, 6336, 1485, 100;
%F Formula
The row polynomials satisfy (4*n^2+2*n+(8*n^3+4*n^2)*x)*P(n,x) = (4*n^2+2*n+(8*n^3+28*n^2+4*n-4)*x+(24*n^3+36*n^2-8*n-4)*x^2)*P(n-1,x) - ((2*n+1)*x+(4*n^2+16*n+6)*x^2+(16*n^2+32*n+8)*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[((4*n^2 + 2*n + (8*n^3 + 28*n^2 + 4*n - 4)*x + (24*n^3 + 36*n^2 - 8*n - 4)*x^2)*P[n - 1, x] - ((2*n + 1)*x + (4*n^2 + 16*n + 6)*x^2 + (16*n^2 + 32*n + 8)*x^3)*D[P[n - 1, x], x])/(4*n^2 + 2*n + (8*n^3 + 4*n^2)*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] = ((4*n^2 + 2*n + (8*n^3 + 28*n^2 + 4*n - 4)*x + (24*n^3 + 36*n^2 - 8*n - 4)*x^2)*v[i - 1] - ((2*n + 1)*x + (4*n^2 + 16*n + 6)*x^2 + (16*n^2 + 32*n + 8)*x^3)*deriv(v[i - 1], x))/(4*n^2 + 2*n + (8*n^3 + 4*n^2)*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-22126d71e196a99d
  • 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-22126d71e196a99d
  • 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-22126d71e196a99d
  • 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-22126d71e196a99d

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