A089627 → x ↦ x+1 → x ↦ x+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
   1:     1;
   2:     1;
   3:     5,     2;
   4:    13,     6;
   5:    49,    36,     6;
   6:   161,   140,    30;
   7:   581,   630,   210,   20;
   8:  2045,  2562,  1050,  140;
   9:  7393, 10696,  5460, 1120,  70;
  10: 26689, 43416, 25956, 6720, 630;

The row polynomials satisfy (n-1)*P(n,x) = (9*n-17+(4*n-8)*x)*P(n-1,x) - (28+30*x+8*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.

P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((9*n - 17 + (4*n - 8)*x)*P[n - 1, x] - (28 + 30*x + 8*x^2)*D[P[n - 1, x], x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten

P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((9*n - 17 + (4*n - 8)*x)*v[i - 1] - (28 + 30*x + 8*x^2)*deriv(v[i - 1], x))/(n - 1)); 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)

Properties

• Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, -1]
  by Affine, reversal and Möbius substitutions (elementary)
• Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
  derived from Affine, reversal and Möbius substitutions (elementary)
• Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
  derived from Affine, reversal and Möbius substitutions (elementary)

Proof chains ? JSON

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

  • from shift_x_plus_one of T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.?
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.?
        • Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›

          • from Triangle read by rows: row n consists of the nonzero coefficients of the expansion of 2^n x^n in terms of Hermite polyn…?
            • Parent-row provers of polytool polytool ? step › direct check
            • Parent-row provers of polytool polytool ? step › direct check
            • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
        • Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›

          • from gamma_polynomial of narayana?
            • Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›

              • from narayana?
                • 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
                • Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ? step › direct check
                • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
                • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

                  • from narayana?
                    • ↑ Row-hypergeometric rows (multiplier sequences) (above)
                    • ↑ Three-term recurrence criterion (above)
                    • ↑ Liu–Wang theorem for three-term recurrences (above)
                    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

                      • from narayana?
                        • ↑ Row-hypergeometric rows (multiplier sequences) (above)
                        • ↑ Three-term recurrence criterion (above)
                        • ↑ Liu–Wang theorem for three-term recurrences (above)
                • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.?
        • ↑ Pólya–Schur theorem on multiplier sequences (above)
        • ↑ Laguerre’s theorem on multiplier sequences (above)
        • ↑ Liu–Wang theorem for three-term recurrences (above)
    • Geometric basis map (elementary) polytool ? step ›

      • from T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.?
        • ↑ Pólya–Schur theorem on multiplier sequences (above)
        • ↑ Laguerre’s theorem on multiplier sequences (above)
        • ↑ Liu–Wang theorem for three-term recurrences (above)

Related ?

Same fingerprint ?

• A391403 → x ↦ x+1 → x ↦ x+1

References

1. [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
2. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
3. [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
4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
5. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023