A033282 → θ+1 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-2\,n + 6\,n x - 2\,n x^{2} + n^{2} + 3\,n^{2} x - n^{2} x^{2} + 3\,n^{3} + n^{4}\right)\,P_{n}(x) = \left(8\,x^{2} - 4\,x^{3} + 2\,n + 18\,n x + 10\,n x^{2} - 6\,n x^{3} + 7\,n^{2} + 25\,n^{2} x + 3\,n^{2} x^{2} - 2\,n^{2} x^{3} + 5\,n^{3} + 12\,n^{3} x + n^{4} + 2\,n^{4} x\right)\,P_{n-1}(x) + \left(2\,x^{2} - 2\,x^{4} + 4\,n x + 6\,n x^{2} - 2\,n x^{4} + 6\,n^{2} x + 6\,n^{2} x^{2} + 2\,n^{3} x + 2\,n^{3} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 5 | 4 | 9 | ||||||
| 2 | 11 | 40 | 15 | 66 | |||||
| 3 | 19 | 144 | 231 | 56 | 450 | ||||
| 4 | 29 | 364 | 1176 | 1176 | 210 | 2955 | |||
| 5 | 41 | 760 | 3960 | 7800 | 5610 | 792 | 18963 | ||
| 6 | 55 | 1404 | 10575 | 33000 | 46035 | 25740 | 3003 | 119812 | |
| 7 | 71 | 2380 | 24255 | 107800 | 235235 | 252252 | 115115 | 11440 | 748548 |
Compute more
?
Technical details
- Node id
n-5ef5d1e2cb1d41ee· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-2fb8ba1337b01a08
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 0)
- 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: 5, 4; 2: 11, 40, 15; 3: 19, 144, 231, 56; 4: 29, 364, 1176, 1176, 210; 5: 41, 760, 3960, 7800, 5610, 792; 6: 55, 1404, 10575, 33000, 46035, 25740, 3003; 7: 71, 2380, 24255, 107800, 235235, 252252, 115115, 11440; 8: 89, 3784, 49896, 296296, 910910, 1513512, 1313312, 505648, 43758; 9: 109, 5724, 94536, 718536, 2923830, 6787872, 9059232, 6587568, 2191878, 167960;
%F FormulaThe row polynomials satisfy (n^4+3*n^3+n^2-2*n+(3*n^2+6*n)*x-(n^2+2*n)*x^2)*P(n,x) = (n^4+5*n^3+7*n^2+2*n+(2*n^4+12*n^3+25*n^2+18*n)*x+(3*n^2+10*n+8)*x^2-(2*n^2+6*n+4)*x^3)*P(n-1,x) + ((2*n^3+6*n^2+4*n)*x+(2*n^3+6*n^2+6*n+2)*x^2-(2*n+2)*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^4 + 5*n^3 + 7*n^2 + 2*n + (2*n^4 + 12*n^3 + 25*n^2 + 18*n)*x + (3*n^2 + 10*n + 8)*x^2 - (2*n^2 + 6*n + 4)*x^3)*P[n - 1, x] + ((2*n^3 + 6*n^2 + 4*n)*x + (2*n^3 + 6*n^2 + 6*n + 2)*x^2 - (2*n + 2)*x^4)*D[P[n - 1, x], x])/(n^4 + 3*n^3 + n^2 - 2*n + (3*n^2 + 6*n)*x - (n^2 + 2*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^4 + 5*n^3 + 7*n^2 + 2*n + (2*n^4 + 12*n^3 + 25*n^2 + 18*n)*x + (3*n^2 + 10*n + 8)*x^2 - (2*n^2 + 6*n + 4)*x^3)*v[i - 1] + ((2*n^3 + 6*n^2 + 4*n)*x + (2*n^3 + 6*n^2 + 6*n + 2)*x^2 - (2*n + 2)*x^4)*deriv(v[i - 1], x))/(n^4 + 3*n^3 + n^2 - 2*n + (3*n^2 + 6*n)*x - (n^2 + 2*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
theta_plus_one of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regio…?
-
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 diagonal dissections of a convex n-gon into k+1 regions.?
-
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
Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
-
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 ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
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
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Three-term recurrence criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (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 semilength n containing exactly k peaks but no peaks …?
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Three-term recurrence criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ 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
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
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 diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Three-term recurrence criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (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)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
-
from
theta_plus_one of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regio…?
References
- [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
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023