A344565 → 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:    15;
  2:    90;
  3:   315,    105;
  4:   840,    840;
  5:  1890,   3780,    378;
  6:  3780,  12600,   3780;
  7:  6930,  34650,  20790,   990;
  8: 11880,  83160,  83160, 11880;
  9: 19305, 180180, 270270, 77220, 2145;

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

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

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

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-86ba7e1c6bc69fa7

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

  • premise (sequence): Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-e2cde2e22920ce64 root: theorem check

      Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?

    • preserver_image reversal, shift 0 e-4dae17a76888d380

      Affine, reversal and Möbius substitutions (elementary) polytool ?

      • premise (sequence): Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ theorem_check liu_wang e-e2cde2e22920ce64 (expanded above)

Related sequences ?

Same fingerprint (11)

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

• basis-map coefficients of A113214, shifted → Veronese 2 (j=1)
• A034867: Triangle of odd-numbered terms in rows of Pascal's triangle.
• A178821 → Veronese 2 (j=1)
• A135838 → Veronese 2 (j=1)
• A178822 → Veronese 2 (j=1)
• A007318 → D → Veronese 2 (j=1)
• A178820 → Veronese 2 (j=1)
• A007318 → Veronese 2 (j=1)
• A159854 → Veronese 2 (j=1)
• A028326 → Veronese 2 (j=1)
• A038208 → Veronese 2 (j=1)

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