A060920 → Veronese 2 (j=1)

OEIS matches ?

• A002450: 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:
  0:     0;
  1:     1;
  2:     5;
  3:    20,     1;
  4:    71,    14;
  5:   235,   105,     1;
  6:   744,   594,    27;
  7:  2285,  2860,   315,   1;
  8:  6865, 12402,  2534,  44;
  9: 20284, 49963, 16407, 726, 1;

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

P[0, x_] := 0;
P[1, x_] := 1;
P[2, x_] := 5;
P[3, x_] := 20 + x;
P[n_, x_] := P[n, x] = Expand[6*P[n - 1, x] - (11 - 2*x)*P[n - 2, x] + (6 - 2*x)*P[n - 3, x] - (1 - 2*x + x^2)*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] = 1; v[3] = 5; v[4] = 20 + x; for(n = 4, N, my(i = n + 1); v[i] = 6*v[i - 1] - (11 - 2*x)*v[i - 2] + (6 - 2*x)*v[i - 3] - (1 - 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)

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-68ce1e8eada1c2da
• 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-68ce1e8eada1c2da
• 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-68ce1e8eada1c2da

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-68ce1e8eada1c2da

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

  • premise (sequence): Bisection of Fibonacci triangle A037027: even-indexed members of column sequences of A037027 (not counting leading zero…
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • preserver_image affine, shift 0 e-f409e7a544612dfe

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

      • premise (sequence): Triangular array binomial(2*n-k, k), k=0..n, n >= 0.
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • theorem_check three_term_recurrence e-abbe6e2e6a5c7279 root: theorem check

          Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?

        • gamma_polynomial scale 1, shift 0 e-313e6d9276f9a630

          Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?

          • premise (sequence): Irregular triangle read by rows formed by taking every other row of the Delannoy array (A008288) regarded as a triangle.
            uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
            • basis_map A008288 e-80180a24956ab79f

              Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?

              • premise (sequence): basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
                uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [0, 0]
                no recorded property covers this requirement
            • basis_map A008288 e-a8f2d1946d8f3a6f

              Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?

              • premise (sequence): basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
                uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [0, 0]
                no recorded property covers this requirement
            • basis_map A008288 e-054f97e0823e3ab6

              Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?

              • premise (sequence): basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
                uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [0, 0]
                no recorded property covers this requirement
            • basis_map A008288 e-912230b718f958a6

              Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?

              • premise (sequence): basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
                uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [0, 0]
                no recorded property covers this requirement
    • basis_map A007318 e-5dc8ce8b8b471ab9

      Geometric basis map (elementary) polytool ?

      • premise (sequence): Triangular array binomial(2*n-k, k), k=0..n, n >= 0.
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ theorem_check three_term_recurrence e-abbe6e2e6a5c7279 (expanded above)
        • ↵ gamma_polynomial scale 1, shift 0 e-313e6d9276f9a630 (expanded above)

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. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
5. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023