A143495 → θ+1 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-1 - x - n x - 2\,n x^{2}\right)\,P_{n-2}(x) + \left(x^{2} + 2\,x^{3}\right)\,P_{n-2}'(x) + \left(2 + 3\,x + n x\right)\,P_{n-1}(x) + \left(-x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 2 + 3\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 2 | 3 | 5 | ||||||
| 3 | 3 | 14 | 9 | 26 | |||||
| 4 | 4 | 36 | 74 | 27 | 141 | ||||
| 5 | 5 | 72 | 291 | 350 | 81 | 799 | |||
| 6 | 6 | 125 | 820 | 1980 | 1562 | 243 | 4736 | ||
| 7 | 7 | 198 | 1900 | 7560 | 12243 | 6734 | 729 | 29371 | |
| 8 | 8 | 294 | 3864 | 22750 | 61684 | 71316 | 28394 | 2187 | 190497 |
Compute more
?
Technical details
- Node id
n-c81f82b847afce84· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-4dee50b16fc7a87e
Observed on the stored rows ?
- Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (affine: slope 1, intercept -1)
- Palindromic rows: no
- γ-positive (gamma_positive): no
- Nonnegative coefficients (
nonn): yes - Only rational roots (
rr_by_factors: every nonzero row is a product of linear factors over ℚ): no
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 2, 3; 3: 3, 14, 9; 4: 4, 36, 74, 27; 5: 5, 72, 291, 350, 81; 6: 6, 125, 820, 1980, 1562, 243; 7: 7, 198, 1900, 7560, 12243, 6734, 729; 8: 8, 294, 3864, 22750, 61684, 71316, 28394, 2187; 9: 9, 416, 7154, 58212, 236355, 465192, 399171, 117950, 6561; 10: 10, 567, 12336, 132300, 749322, 2235975, 3323380, 2172780, 484922, 19683;
%F FormulaThe row polynomials satisfy P(n,x) = -(1+(n+1)*x+2*n*x^2)*P(n-2,x) + (x^2+2*x^3)*d/dx P(n-2,x) + (2+(n+3)*x)*P(n-1,x) - x^2*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2 + 3*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 2 + 3*x;
P[n_, x_] := P[n, x] = Expand[-(1 + (n + 1)*x + 2*n*x^2)*P[n - 2, x] + (x^2 + 2*x^3)*D[P[n - 2, x], x] + (2 + (n + 3)*x)*P[n - 1, x] - x^2*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 2 + 3*x; for(n = 3, N, my(i = n); v[i] = -(1 + (n + 1)*x + 2*n*x^2)*v[i - 2] + (x^2 + 2*x^3)*deriv(v[i - 2], x) + (2 + (n + 3)*x)*v[i - 1] - x^2*deriv(v[i - 1], x)); 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)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
theta_plus_one of Triangle read by rows: 3-Stirling numbers of the second kind.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: 3-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: 3-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 3-Stirling numbers of the second kind.?
- ↑ Liu–Wang theorem (above)
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Liu–Wang theorem (above)
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Liu–Wang theorem (above)
- ↑ Iterated real-rootedness preservers (above)
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
- ↑ Ray basis map theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
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
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
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
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
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
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Ray basis map theorem (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: 3-Stirling numbers of the second kind.?
-
-
from
reversal of Triangle read by rows: 3-Stirling numbers of the second kind.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: 3-Stirling numbers of the second kind.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
-
from
theta_plus_one of Triangle read by rows: 3-Stirling numbers of the second kind.?
Related ?
Same fingerprint ?
References
- [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
- [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
- [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
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.