A137320 → Veronese 2

OEIS matches ?

• A357711: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?
• A188588: row sums, 12 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS

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.

Triangle begins:
  0: 1;
  1: 0;
  2: 0,      4;
  3: 0,     12;
  4: 0,     44,      16;
  5: 0,    200,     160;
  6: 0,   1096,    1360,     64;
  7: 0,   7056,   11760,   1344;
  8: 0,  52272,  108304,  20608,  256;
  9: 0, 438336, 1076544, 290304, 9216;

The row polynomials satisfy P(n,x) = (2*n-3)*P(n-1,x) - (n^2-4*n+4-4*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 0.

P[0, x_] := 1;
P[1, x_] := 0;
P[n_, x_] := P[n, x] = Expand[(2*n - 3)*P[n - 1, x] - (n^2 - 4*n + 4 - 4*x)*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 0; for(n = 2, N, my(i = n + 1); v[i] = (2*n - 3)*v[i - 1] - (n^2 - 4*n + 4 - 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)

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-6763d08c05528c18
• 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-6763d08c05528c18
• 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-6763d08c05528c18

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

• veronese_section r=2, j=0, shift 0 e-6763d08c05528c18

  Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?

  • premise (sequence): Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[…
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • parent_provers root_domain e-6aa1e3cc7e408461 root: theorem check

      Parent-row provers of polytool polytool ?

Related sequences ?

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