A008288 → Veronese 2

OEIS matches ?

• A116404: 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 ?

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:
   1: 1;
   2: 1;
   3: 1,   1;
   4: 1,   5;
   5: 1,  13,   1;
   6: 1,  25,   9;
   7: 1,  41,  41,   1;
   8: 1,  61, 129,  13;
   9: 1,  85, 321,  85,  1;
  10: 1, 113, 681, 377, 17;

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

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

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

Proved properties

• Real-rooted. Every row P_n, n >= 1, 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-cf3204e5bd13ff92
• Coefficients of one sign. Every nonzero row, n >= 1: 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-cf3204e5bd13ff92
• Hadamard kernel (Malo). Rows P_n, n >= 1, 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-cf3204e5bd13ff92
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 2
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-cf3204e5bd13ff92

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-cf3204e5bd13ff92

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

  • premise (sequence): Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.
    uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang_derivative_lag e-b176436450506e78 root: theorem check

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

    • preserver_image reversal, shift 0 e-73f1cbc14f4fad08

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

      • premise (sequence): Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.
        uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ theorem_check liu_wang_derivative_lag e-b176436450506e78 (expanded above)
        • basis_map A008288 e-796ce5140a0b4b04

          Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?

          • premise (sequence): basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
            uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in [0, 0]
            no recorded property covers this requirement
        • basis_map A008288 e-b8e0a0fa3ba7bf57

          Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?

          • premise (sequence): basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
            uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in [0, 0]
            no recorded property covers this requirement
    • ↵ basis_map A008288 e-796ce5140a0b4b04 (expanded above)
    • ↵ basis_map A008288 e-b8e0a0fa3ba7bf57 (expanded above)

Related sequences ?

Same fingerprint (1)

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

• delannoy → Veronese 2

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