A144084 → D+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:  1;
  1:  2,    1;
  2:  5,    8,      2;
  3: 10,   45,     36,       6;
  4: 17,  160,    360,     192,      24;
  5: 26,  425,   2000,    3000,    1200,      120;
  6: 37,  936,   7650,   24000,   27000,     8640,      720;
  7: 50, 1813,  22932,  124950,  294000,   264600,    70560,     5040;
  8: 65, 3200,  58016,  489216, 1999200,  3763200,  2822400,   645120,   40320;
  9: 82, 5265, 129600, 1566432, 9906624, 32387040, 50803200, 32659200, 6531840, 362880;

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

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

P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((n^2 + 1 + (2*n^3 - 3*n^2 + 4*n - 4)*x + (4*n^2 - 6*n + 3)*x^2 + (2*n - 1)*x^3)*v[i - 1] - ((n^2 + 1)*x^2 + (2*n - 1)*x^3 + x^4)*deriv(v[i - 1], x))/(n^2 - 2*n + 2 + (2*n - 3)*x + x^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
• Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
  by Laguerre’s theorem on differential operators

Proof chains ? JSON

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

  • from T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.?
    • 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
    • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? step › direct check
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from basis_map_A008277 of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 …?
        • Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›

          • from Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.?
            • Parent-row provers of polytool polytool ? step › direct check
            • Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
            • Parent-row provers of polytool polytool ? step › direct check
        • Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›

          • from Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.?
            • ↑ Parent-row provers of polytool (above)
            • ↑ Iterated real-rootedness preservers (above)
            • ↑ Parent-row provers of polytool (above)
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.?
            • ↑ Row-hypergeometric rows (multiplier sequences) (above)
            • ↑ Liu–Wang theorem (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)

Related ?

Same fingerprint ?

• A395972 → D+1

References

1. [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
2. [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
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. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
5. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.