A114655 → θ+1 → D

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
   1:     0;
   2:     4;
   3:    24,     12;
   4:    96,    144,      24;
   5:   320,    960,     480,      40;
   6:   960,   4800,    4800,    1200,      60;
   7:  2688,  20160,   33600,   16800,    2520,      84;
   8:  7168,  75264,  188160,  156800,   47040,    4704,    112;
   9: 18432, 258048,  903168, 1128960,  564480,  112896,   8064,   144;
  10: 46080, 829440, 3870720, 6773760, 5080320, 1693440, 241920, 12960, 180;

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

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

P(N) = {my(v = vector(N)); v[1] = 0; v[2] = 4; for(n = 3, N, my(i = n); v[i] = ((2*n + (3*n - 6)*x)*v[i - 1] + (4*x - 2*x^2)*deriv(v[i - 1], x))/(n - 2)); 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 (−∞, 0]
  by Laguerre’s theorem on differential operators
• Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
  derived from Laguerre’s theorem on differential operators
• Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
  derived from Laguerre’s theorem on differential operators
• Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
  by Laguerre’s theorem on differential operators

Proof chains ? JSON

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

  • from theta_plus_one of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents…?
    • Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›

      • from Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schr…?
        • 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 reversal of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k…?
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schr…?
                • ↑ 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) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schr…?
                • ↑ Liu–Wang theorem (above)
                • ↑ Row-hypergeometric rows (multiplier sequences) (above)
    • Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›

      • from Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schr…?
        • ↑ Liu–Wang theorem (above)
        • ↑ Row-hypergeometric rows (multiplier sequences) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

Related ?

Same fingerprint ?

• A114656: Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colo…
• A114656 → reverse
• A114655: Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n…
• A114655 → reverse
• A114656 → θ+1 → D
• A114687: Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colo…
• A114687 → θ+1 → D
• A114687 → reverse

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. [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
3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.