A178820 → Veronese 2 → D

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:    0;
  1:    0;
  2:   10;
  3:   60;
  4:  210,    70;
  5:  560,   560;
  6: 1260,  2520,   252;
  7: 2520,  8400,  2520;
  8: 4620, 23100, 13860,  660;
  9: 7920, 55440, 55440, 7920;

The row polynomials satisfy (n^2-3*n+2)*P(n,x) = (n^2+2*n-3+(n^2-9)*x)*P(n-1,x) + ((2*n+6)*x-(2*n+6)*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 10.

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

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

Properties

• Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
  by Laguerre’s theorem on differential operators
• Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
  derived from Laguerre’s theorem on differential operators
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Laguerre’s theorem on differential operators

Proof chains ? JSON

• Laguerre’s theorem on differential operators [SP14] polytool ? step ›

  • from veronese_section_2_0 of Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
    • Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ? step ›

      • from Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
        • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? step › direct check
        • Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
            • ↑ Liu–Wang theorem (above)
            • ↑ Row-hypergeometric rows (multiplier sequences) (above)
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
                • ↑ Liu–Wang theorem (above)
                • ↑ Row-hypergeometric rows (multiplier sequences) (above)
                • Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
            • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Iterated real-rootedness preservers (above)

Related ?

Same fingerprint ?

• A028326 → Veronese 2 (j=1)
• A178821 → Veronese 2 (j=1)
• A178822 → Veronese 2 → D
• A109447: Binomial coefficients C(n,k) with n-k odd, read by rows.
• A178820 → Veronese 2 (j=1)
• A003506 → Veronese 2 → D
• A003506 → Veronese 2 (j=1)
• A034867: Triangle of odd-numbered terms in rows of Pascal's triangle.
• A038208 → Veronese 2 (j=1)
• basis-map coefficients of A113214, shifted → Veronese 2 (j=1)
• basis-map coefficients of A113214, shifted → Veronese 2 → D
• A038208 → Veronese 2 → D
• A007318 → Veronese 2 (j=1)
• A034839 → D
• A344565 → Veronese 2 (j=1)
• A228955 → D
• A178822 → Veronese 2 (j=1)
• A135838 → Veronese 2 (j=1)
• A178821 → Veronese 2 → D
• A159854 → Veronese 2 (j=1)
• A119900: Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0…

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. [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
4. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
5. [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
6. [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
7. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.