A249252 → Veronese 2 (j=1)

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.

Triangle begins:
  0:  0;
  1:  4;
  2:  8;
  3: 12,   16;
  4: 16,   96;
  5: 20,  304,    64;
  6: 24,  704,   640;
  7: 28, 1360,  3264,   256;
  8: 32, 2336, 11520,  3584;
  9: 36, 3696, 32064, 25344, 1024;

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

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

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

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-2b1d37482ce1946c
• 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-2b1d37482ce1946c
• 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-2b1d37482ce1946c
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-2b1d37482ce1946c

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=1, shift 0 e-2b1d37482ce1946c

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

  • premise (sequence): Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang_derivative_lag e-fb471901eb718e65 root: theorem check

      Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?

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
4. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003