A055151 → basis A007318 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-6 - 6\,x + 8\,x^{2} - n + 5\,n x + 4\,n x^{2} + 3\,n^{2} + 4\,n^{2} x + n^{3}\right)\,P_{n}(x) = \left(-2 - 2\,x - 12\,x^{2} - 16\,x^{3} - 11\,n - 19\,n x + 8\,n x^{2} + 16\,n x^{3} + 5\,n^{2} + 20\,n^{2} x + 16\,n^{2} x^{2} + 5\,n^{3} + 4\,n^{3} x\right)\,P_{n-1}(x) + \left(-12 - 58\,x - 110\,x^{2} - 96\,x^{3} - 32\,x^{4} - 18\,n - 66\,n x - 80\,n x^{2} - 32\,n x^{3} - 6\,n^{2} - 14\,n^{2} x - 8\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | Pn(1) |
|---|---|---|---|---|---|
| 0 | 1 | 1 | |||
| 1 | 1 | 1 | |||
| 2 | 3 | 1 | 4 | ||
| 3 | 7 | 3 | 10 | ||
| 4 | 19 | 14 | 2 | 35 | |
| 5 | 51 | 50 | 10 | 111 | |
| 6 | 141 | 180 | 60 | 5 | 386 |
| 7 | 393 | 616 | 280 | 35 | 1324 |
Compute more
?
Technical details
- Node id
n-3b7d609dbe56e329· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-4749f5f4c0c52e68
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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: 1; 2: 3, 1; 3: 7, 3; 4: 19, 14, 2; 5: 51, 50, 10; 6: 141, 180, 60, 5; 7: 393, 616, 280, 35; 8: 1107, 2072, 1232, 252, 14; 9: 3139, 6840, 5040, 1428, 126;
%F FormulaThe row polynomials satisfy (n^3+3*n^2-n-6+(4*n^2+5*n-6)*x+(4*n+8)*x^2)*P(n,x) = (5*n^3+5*n^2-11*n-2+(4*n^3+20*n^2-19*n-2)*x+(16*n^2+8*n-12)*x^2+(16*n-16)*x^3)*P(n-1,x) - (6*n^2+18*n+12+(14*n^2+66*n+58)*x+(8*n^2+80*n+110)*x^2+(32*n+96)*x^3+32*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[((5*n^3 + 5*n^2 - 11*n - 2 + (4*n^3 + 20*n^2 - 19*n - 2)*x + (16*n^2 + 8*n - 12)*x^2 + (16*n - 16)*x^3)*P[n - 1, x] - (6*n^2 + 18*n + 12 + (14*n^2 + 66*n + 58)*x + (8*n^2 + 80*n + 110)*x^2 + (32*n + 96)*x^3 + 32*x^4)*D[P[n - 1, x], x])/(n^3 + 3*n^2 - n - 6 + (4*n^2 + 5*n - 6)*x + (4*n + 8)*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] = ((5*n^3 + 5*n^2 - 11*n - 2 + (4*n^3 + 20*n^2 - 19*n - 2)*x + (16*n^2 + 8*n - 12)*x^2 + (16*n - 16)*x^3)*v[i - 1] - (6*n^2 + 18*n + 12 + (14*n^2 + 66*n + 58)*x + (8*n^2 + 80*n + 110)*x^2 + (32*n + 96)*x^3 + 32*x^4)*deriv(v[i - 1], x))/(n^3 + 3*n^2 - n - 6 + (4*n^2 + 5*n - 6)*x + (4*n + 8)*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
shift_x_plus_one of Triangular array of Motzkin polynomial coefficients.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangular array of Motzkin polynomial coefficients.?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
narayana?
-
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
narayana?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? 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…?
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
delannoy?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
from
delannoy?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
delannoy?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
delannoy?
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
-
from
Triangular array of Motzkin polynomial coefficients.?
-
-
from
shift_x_plus_one of Triangular array of Motzkin polynomial coefficients.?
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