reversed rows → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-n + n^{2}\right)\,P_{n}(x) = \left(-1 - 4\,x - 2\,n x + n^{2} + 2\,n^{2} x\right)\,P_{n-1}(x) + \left(-x - 4\,x^{2} - n x - 4\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 2\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 2 | 2 | ||||||
| 2 | 3 | 3 | ||||||
| 3 | 4 | 4 | 8 | |||||
| 4 | 5 | 10 | 15 | |||||
| 5 | 6 | 18 | 6 | 30 | ||||
| 6 | 7 | 28 | 21 | 56 | ||||
| 7 | 8 | 40 | 48 | 8 | 104 | |||
| 8 | 9 | 54 | 90 | 36 | 189 | |||
| 9 | 10 | 70 | 150 | 100 | 10 | 340 | ||
| 10 | 11 | 88 | 231 | 220 | 55 | 605 | ||
| 11 | 12 | 108 | 336 | 420 | 180 | 12 | 1068 | |
| 12 | 13 | 130 | 468 | 728 | 455 | 78 | 1872 | |
| 13 | 14 | 154 | 630 | 1176 | 980 | 294 | 14 | 3262 |
| 14 | 15 | 180 | 825 | 1800 | 1890 | 840 | 105 | 5655 |
Compute more
?
Technical details
- Node id
n-3a607c1aa171bfc2· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-8de4b75c4559d58b
Observed on the stored rows ?
- Degrees: -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6 (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: 0; 1: 2; 2: 3; 3: 4, 4; 4: 5, 10; 5: 6, 18, 6; 6: 7, 28, 21; 7: 8, 40, 48, 8; 8: 9, 54, 90, 36; 9: 10, 70, 150, 100, 10;
%F FormulaThe row polynomials satisfy (n^2-n)*P(n,x) = (n^2-1+(2*n^2-2*n-4)*x)*P(n-1,x) - ((n+1)*x+(4*n+4)*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 2.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 - 1 + (2*n^2 - 2*n - 4)*x)*P[n - 1, x] - ((n + 1)*x + (4*n + 4)*x^2)*D[P[n - 1, x], x])/(n^2 - n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = ((n^2 - 1 + (2*n^2 - 2*n - 4)*x)*v[i - 1] - ((n + 1)*x + (4*n + 4)*x^2)*deriv(v[i - 1], x))/(n^2 - n)); 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 ?
- A052553: Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.
- A030528: Triangle read by rows: T(n,k) = binomial(k,n-k).
- A113214 → θ+1
- A178820 → Veronese 2 (j=1) → basis A013611
- A169803: Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).
- A034807 → D
- A028326 → Veronese 2 (j=1) → basis A013611
- A026729: Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
- A113214 → θ+1 → reverse
- A034867 → basis A013611
- A038208 → Veronese 2 (j=1) → basis A013611
- basis-map coefficients of A113214, shifted → Veronese 2 (j=1) → basis A013611
- A007318 → Veronese 2 (j=1) → basis A013611
- A178822 → Veronese 2 (j=1) → basis A013611
- A178821 → Veronese 2 (j=1) → basis A013611
- A011973: Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of …
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.