basis-map coefficients of A026729, shifted → D+1

only rational roots

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

Recurrence
\(\left(-2 + x + n\right)\,P_{n}(x) = \left(x - x^{2} - n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2-1-1-2
30213
400-3-1-4
5000415
60000-5-1-6
700000617
8000000-7-1-8
90000000819
1000000000-9-1-10
1100000000010111
120000000000-11-1-12
130000000000012113
14000000000000-13-1-14
15000000000000014115

Computed in your browser ?

Technical details
Node id
n-403f3ef85bba9ebc · revision 1 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-2327141074f67bdf

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 -1)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): no
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): yes

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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:  1;
   2: -1, -1;
   3:  0,  2,  1;
   4:  0,  0, -3, -1;
   5:  0,  0,  0,  4,  1;
   6:  0,  0,  0,  0, -5, -1;
   7:  0,  0,  0,  0,  0,  6,  1;
   8:  0,  0,  0,  0,  0,  0, -7, -1;
   9:  0,  0,  0,  0,  0,  0,  0,  8,  1;
  10:  0,  0,  0,  0,  0,  0,  0,  0, -9, -1;
%F Formula
The row polynomials satisfy (n-2+x)*P(n,x) = -((n-1)*x+x^2)*P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-((n - 1)*x + x^2)*P[n - 1, x])/(n - 2 + x)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (-((n - 1)*x + x^2)*v[i - 1])/(n - 2 + x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 1, 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-dffa2a76d9a73ed0
  • Coefficients of one sign. Every nonzero row, n >= 1: 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-dffa2a76d9a73ed0
  • Hadamard kernel (Malo). Rows P_n, n >= 1, 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-dffa2a76d9a73ed0

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

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

References

  1. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.