reversed rows → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-n - 5\,n x + 4\,n x^{2} + 4\,n^{2} x + n^{3}\right)\,P_{n}(x) = \left(-2\,n - 9\,n x + 2\,n x^{2} + 8\,n x^{3} + n^{2} + 4\,n^{2} x + 8\,n^{2} x^{2} + n^{3} + 2\,n^{3} x\right)\,P_{n-1}(x) + \left(-3\,x^{2} - 16\,x^{3} - 16\,x^{4} - 2\,n x - 12\,n x^{2} - 16\,n x^{3} - n^{2} x - 4\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | Pn(1) |
|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||
| 1 | 3 | 2 | 5 | |||
| 2 | 4 | 3 | 7 | |||
| 3 | 5 | 8 | 2 | 15 | ||
| 4 | 6 | 15 | 5 | 26 | ||
| 5 | 7 | 24 | 15 | 2 | 48 | |
| 6 | 8 | 35 | 35 | 7 | 85 | |
| 7 | 9 | 48 | 68 | 24 | 2 | 151 |
Compute more
?
Technical details
- Node id
n-31ba686292905fdf· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-4d17291db27785d7
Observed on the stored rows ?
- Degrees: 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7 (half 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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 3, 2; 2: 4, 3; 3: 5, 8, 2; 4: 6, 15, 5; 5: 7, 24, 15, 2; 6: 8, 35, 35, 7; 7: 9, 48, 68, 24, 2; 8: 10, 63, 117, 66, 9; 9: 11, 80, 185, 150, 35, 2;
%F FormulaThe row polynomials satisfy (n^3-n+(4*n^2-5*n)*x+4*n*x^2)*P(n,x) = (n^3+n^2-2*n+(2*n^3+4*n^2-9*n)*x+(8*n^2+2*n)*x^2+8*n*x^3)*P(n-1,x) - ((n^2+2*n)*x+(4*n^2+12*n+3)*x^2+(16*n+16)*x^3+16*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n^3 + n^2 - 2*n + (2*n^3 + 4*n^2 - 9*n)*x + (8*n^2 + 2*n)*x^2 + 8*n*x^3)*P[n - 1, x] - ((n^2 + 2*n)*x + (4*n^2 + 12*n + 3)*x^2 + (16*n + 16)*x^3 + 16*x^4)*D[P[n - 1, x], x])/(n^3 - n + (4*n^2 - 5*n)*x + 4*n*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((n^3 + n^2 - 2*n + (2*n^3 + 4*n^2 - 9*n)*x + (8*n^2 + 2*n)*x^2 + 8*n*x^3)*v[i - 1] - ((n^2 + 2*n)*x + (4*n^2 + 12*n + 3)*x^2 + (16*n + 16)*x^3 + 16*x^4)*deriv(v[i - 1], x))/(n^3 - n + (4*n^2 - 5*n)*x + 4*n*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)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
-
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
reversal of Riordan array (1+2x,x(1+x)).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1+2x,x(1+x)).?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 0 <= k <= n.?
no recorded property covers this requirement
-
from
basis-map coefficients of Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 0 <= k <= n.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
Riordan array (1+2x,x(1+x)).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1+2x,x(1+x)).?
- ↑ Affine-current basis map theorem (above)
- ↑ Ma–Wang interval theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
from
Riordan array (1+2x,x(1+x)).?
-
-
from
reversal of Riordan array (1+2x,x(1+x)).?
Related ?
Same fingerprint ?
References
- [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.