A274498 → θ+1

nonnegative coefficients only rational roots

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means

Recurrence
\(\left(2 + 3\,x + 2\,n x + n x^{2} + n^{2} x^{2}\right)\,P_{n}(x) = \left(10 + 3\,x - 12\,x^{2} - 4\,x^{3} - 4\,n + 18\,n x + 9\,n x^{2} - 2\,n x^{3} - 6\,n^{2} x + 11\,n^{2} x^{2} + 4\,n^{2} x^{3} - 2\,n^{3} x^{2} + 2\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(2 + 2\,x - 12\,x^{2} - 20\,x^{3} - 8\,x^{4} + 4\,n x + 4\,n x^{2} - 14\,n x^{3} - 12\,n x^{4} + 2\,n^{2} x^{2} + 2\,n^{2} x^{3} - 4\,n^{2} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
133
231215
393645
4972108189
527216324567
6273249728642187
781972291625926561
8811296583210368648024057
9243388817496311041944072171
10243486029160777609720046656255879
117291458087480233280291600139968767637
12729174961312204665608748008398083265922657205
132187524883936601399680262440025194249797767971615
142187612365511242449440612360088179846858432223948827103491

Computed in your browser ?

Technical details
Node id
n-5bbc9a303e54ec16 · revision 1 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-4a9146a6908256f6

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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 ℚ): yes

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:   3,   12;
  3:   9,   36;
  4:   9,   72,   108;
  5:  27,  216,   324;
  6:  27,  324,   972,   864;
  7:  81,  972,  2916,  2592;
  8:  81, 1296,  5832, 10368,  6480;
  9: 243, 3888, 17496, 31104, 19440;
%F Formula
The row polynomials satisfy (2+(2*n+3)*x+(n^2+n)*x^2)*P(n,x) = -(4*n-10+(6*n^2-18*n-3)*x+(2*n^3-11*n^2-9*n+12)*x^2-(2*n^3+4*n^2-2*n-4)*x^3)*P(n-1,x) + (2+(4*n+2)*x+(2*n^2+4*n-12)*x^2+(2*n^2-14*n-20)*x^3-(4*n^2+12*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[(-(4*n - 10 + (6*n^2 - 18*n - 3)*x + (2*n^3 - 11*n^2 - 9*n + 12)*x^2 - (2*n^3 + 4*n^2 - 2*n - 4)*x^3)*P[n - 1, x] + (2 + (4*n + 2)*x + (2*n^2 + 4*n - 12)*x^2 + (2*n^2 - 14*n - 20)*x^3 - (4*n^2 + 12*n + 8)*x^4)*D[P[n - 1, x], x])/(2 + (2*n + 3)*x + (n^2 + 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] = (-(4*n - 10 + (6*n^2 - 18*n - 3)*x + (2*n^3 - 11*n^2 - 9*n + 12)*x^2 - (2*n^3 + 4*n^2 - 2*n - 4)*x^3)*v[i - 1] + (2 + (4*n + 2)*x + (2*n^2 + 4*n - 12)*x^2 + (2*n^2 - 14*n - 20)*x^3 - (4*n^2 + 12*n + 8)*x^4)*deriv(v[i - 1], x))/(2 + (2*n + 3)*x + (n^2 + 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-493e6c3c99ee8db4
  • 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-493e6c3c99ee8db4
  • 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-493e6c3c99ee8db4

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

Same fingerprint (1)

Equal up to content, sign, reversal and a small index shift.

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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.