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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
122
2246
34812
44161232
58322464
68487232160
7169614464320
81612828825680768
9322565765121601536
103232096012808001923584
11646401920256016003847168
1264768288051204800230444816384
1312815365760102409600460889632768
14128179280641792022400161286272102473728

Computed in your browser ?

Technical details
Node id
n-39047ba7ddceb09b · revision 1 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-b1032d52426bb000

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:  2;
  2:  2,   4;
  3:  4,   8;
  4:  4,  16,  12;
  5:  8,  32,  24;
  6:  8,  48,  72,  32;
  7: 16,  96, 144,  64;
  8: 16, 128, 288, 256,  80;
  9: 32, 256, 576, 512, 160;
%F Formula
The row polynomials satisfy (8+(4*n+6)*x+(n^2+n)*x^2)*P(n,x) = -(8*n-24+(6*n^2-28*n+2)*x+(n^3-10*n^2-7*n+12)*x^2-(n^3+2*n^2-n-2)*x^3)*P(n-1,x) + (8+(8*n-4)*x+(2*n^2-2*n-28)*x^2-(16*n+20)*x^3-(2*n^2+6*n+4)*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 - 24 + (6*n^2 - 28*n + 2)*x + (n^3 - 10*n^2 - 7*n + 12)*x^2 - (n^3 + 2*n^2 - n - 2)*x^3)*P[n - 1, x] + (8 + (8*n - 4)*x + (2*n^2 - 2*n - 28)*x^2 - (16*n + 20)*x^3 - (2*n^2 + 6*n + 4)*x^4)*D[P[n - 1, x], x])/(8 + (4*n + 6)*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] = (-(8*n - 24 + (6*n^2 - 28*n + 2)*x + (n^3 - 10*n^2 - 7*n + 12)*x^2 - (n^3 + 2*n^2 - n - 2)*x^3)*v[i - 1] + (8 + (8*n - 4)*x + (2*n^2 - 2*n - 28)*x^2 - (16*n + 20)*x^3 - (2*n^2 + 6*n + 4)*x^4)*deriv(v[i - 1], x))/(8 + (4*n + 6)*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-aaacb3fb62ab0797
  • 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-aaacb3fb62ab0797
  • 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-aaacb3fb62ab0797

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 (3)

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.