Real-rooted atlas

A103633 → 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(2\,x\right)\,P_{n-2}(x) + \left(x - x^{2}\right)\,P_{n-4}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 1\)
\(P_{3}(x) = x\)

Rows ?

nx0x1x2x3x4x5x6Pn(1)
00
111
211
3011
4022
50112
60134
700314
800448
9001618
1000110516
11000510116
12000620632
1300011515132
1400012135764

Generated b-files: A016116 (row sums), A060546 (row sums), A158780 (row sums), A163403 (row sums) ?

Computed in your browser ?

Technical details
Node id
n-96e4112733996073 · revision 1 · JSON
Definition source
derived:veronese_section_2_1
Fingerprint
f6-f99b371138192170

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 ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

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: 0, 1;
  4: 0, 2;
  5: 0, 1, 1;
  6: 0, 1, 3;
  7: 0, 0, 3, 1;
  8: 0, 0, 4, 4;
  9: 0, 0, 1, 6, 1;
%F Formula
The row polynomials satisfy P(n,x) = 2*x*P(n-2,x) + (x-x^2)*P(n-4,x) for n >= 4, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 1, P(3,x) = x.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 1;
P[2, x_] := 1;
P[3, x_] := x;
P[n_, x_] := P[n, x] = Expand[2*x*P[n - 2, x] + (x - x^2)*P[n - 4, 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; v[3] = 1; v[4] = x; for(n = 4, N, my(i = n + 1); v[i] = 2*x*v[i - 2] + (x - x^2)*v[i - 4]); 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-b73b96ec0a2e1659
  • 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-b73b96ec0a2e1659
  • 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-b73b96ec0a2e1659

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. [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