Real-rooted atlas

A132393 → Veronese 2 (j=1)

nonnegative coefficients

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

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

Rows ?

nx0x1x2x3Pn(1)
00
111
211
3213
46612
52435160
612022515360
7720162417512520

Show all 15 stored rows

Computed in your browser ?

Technical details
Node id
n-b9bba3062ead0647 · revision 1 · JSON
Definition source
derived:veronese_section_2_1
Fingerprint
f6-35c9f14f8879aed6

Observed on the stored rows ?

  • Degrees: -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6 (half affine: slope 1, intercept -1)
  • 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:     0;
  1:     1;
  2:     1;
  3:     2,      1;
  4:     6,      6;
  5:    24,     35,     1;
  6:   120,    225,    15;
  7:   720,   1624,   175,   1;
  8:  5040,  13132,  1960,  28;
  9: 40320, 118124, 22449, 546, 1;
%F Formula
The row polynomials satisfy P(n,x) = (2*n-3)*P(n-1,x) - (n^2-4*n+4-x)*P(n-2,x) for n >= 2, with P(0,x) = 0, P(1,x) = 1.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2*n - 3)*P[n - 1, x] - (n^2 - 4*n + 4 - x)*P[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] = 0; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = (2*n - 3)*v[i - 1] - (n^2 - 4*n + 4 - x)*v[i - 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-e29866e6e7600a77
  • 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-e29866e6e7600a77
  • 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-e29866e6e7600a77

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. [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
  2. [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
  3. [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3