A081579 → θ+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(-n + 2\,n x + 9\,n x^{2} - 5\,n^{2} x + 5\,n^{2} x^{2}\right)\,P_{n}(x) = \left(18\,x + 84\,x^{2} + 18\,x^{3} - n - 18\,n x - 31\,n x^{2} + 10\,n x^{3} - 5\,n^{2} x - 45\,n^{2} x^{2}\right)\,P_{n-1}(x) + \left(x + 27\,x^{2} + 163\,x^{3} + 9\,x^{4} + 5\,n x^{2} + 90\,n x^{3} + 5\,n x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1123
2112316
312233460
4132138645240
51423184241056896
6152573158495515673328
7162903404450551806217812096
81721308830418030124563052288943520
9182178814864486305835626012476836910154880
1019223432422410873020325615222248448702946011546816
111102297336884213330567156661682341328829899910561121916928
12111236785334438055513450562271892179340868499913336013486672136680576
13112244587410463165528257066487852741468842385591263310203786178327931423162880
141132531399664991005541035616061437252151682065041990172602180211298992230239241579953920

Computed in your browser ?

Technical details
Node id
n-eb96c9d5ffe605f1 · revision 1 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-30657424ae118196

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,  2;
  2: 1, 12,    3;
  3: 1, 22,   33,     4;
  4: 1, 32,  138,    64,     5;
  5: 1, 42,  318,   424,   105,     6;
  6: 1, 52,  573,  1584,   955,   156,     7;
  7: 1, 62,  903,  4044,  5055,  1806,   217,    8;
  8: 1, 72, 1308,  8304, 18030, 12456,  3052,  288,   9;
  9: 1, 82, 1788, 14864, 48630, 58356, 26012, 4768, 369, 10;
%F Formula
The row polynomials satisfy -(n+(5*n^2-2*n)*x-(5*n^2+9*n)*x^2)*P(n,x) = -(n+(5*n^2+18*n-18)*x+(45*n^2+31*n-84)*x^2-(10*n+18)*x^3)*P(n-1,x) + (x+(5*n+27)*x^2+(90*n+163)*x^3+(5*n+9)*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[(-(n + (5*n^2 + 18*n - 18)*x + (45*n^2 + 31*n - 84)*x^2 - (10*n + 18)*x^3)*P[n - 1, x] + (x + (5*n + 27)*x^2 + (90*n + 163)*x^3 + (5*n + 9)*x^4)*D[P[n - 1, x], x])/(-n - (5*n^2 - 2*n)*x + (5*n^2 + 9*n)*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] = (-(n + (5*n^2 + 18*n - 18)*x + (45*n^2 + 31*n - 84)*x^2 - (10*n + 18)*x^3)*v[i - 1] + (x + (5*n + 27)*x^2 + (90*n + 163)*x^3 + (5*n + 9)*x^4)*deriv(v[i - 1], x))/(-n - (5*n^2 - 2*n)*x + (5*n^2 + 9*n)*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-35c7abaeeb3cdfcb
  • 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-35c7abaeeb3cdfcb
  • 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-35c7abaeeb3cdfcb
  • 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-35c7abaeeb3cdfcb

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. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.