A391045 → θ+1 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-2 + 8\,n - 10\,n^{2} + 4\,n^{3}\right)\,P_{n}(x) = \left(2\,n + 7\,n x - 6\,n^{2} - 16\,n^{2} x + 4\,n^{3} + 7\,n^{3} x\right)\,P_{n-1}(x) + \left(-10\,x + 10\,x^{2} + 10\,n x - 18\,n x^{2} + 12\,n^{2} x + 2\,n^{2} x^{2}\right)\,P_{n-1}'(x) + \left(-12\,x^{2} + 3\,x^{3} + 20\,n x^{2} - 5\,n x^{3}\right)\,P_{n-1}''(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 2 | 1 | 3 | ||||||
| 3 | 3 | 8 | 1 | 12 | |||||
| 4 | 4 | 30 | 18 | 1 | 53 | ||||
| 5 | 5 | 80 | 126 | 32 | 1 | 244 | |||
| 6 | 6 | 175 | 560 | 360 | 50 | 1 | 1152 | ||
| 7 | 7 | 336 | 1890 | 2400 | 825 | 72 | 1 | 5531 | |
| 8 | 8 | 588 | 5292 | 11550 | 7700 | 1638 | 98 | 1 | 26875 |
Compute more
?
Technical details
- Node id
n-998d2f929b97c6f3· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-c6c82bb93c30543f
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, 1; 3: 3, 8, 1; 4: 4, 30, 18, 1; 5: 5, 80, 126, 32, 1; 6: 6, 175, 560, 360, 50, 1; 7: 7, 336, 1890, 2400, 825, 72, 1; 8: 8, 588, 5292, 11550, 7700, 1638, 98, 1; 9: 9, 960, 12936, 44352, 50050, 20384, 2940, 128, 1; 10: 10, 1485, 28512, 144144, 252252, 171990, 47040, 4896, 162, 1;
%F FormulaThe row polynomials satisfy (4*n^3-10*n^2+8*n-2)*P(n,x) = (4*n^3-6*n^2+2*n+(7*n^3-16*n^2+7*n)*x)*P(n-1,x) + ((12*n^2+10*n-10)*x+(2*n^2-18*n+10)*x^2)*d/dx P(n-1,x) + ((20*n-12)*x^2-(5*n-3)*x^3)*d^2/dx^2 P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((4*n^3 - 6*n^2 + 2*n + (7*n^3 - 16*n^2 + 7*n)*x)*P[n - 1, x] + ((12*n^2 + 10*n - 10)*x + (2*n^2 - 18*n + 10)*x^2)*D[P[n - 1, x], x] + ((20*n - 12)*x^2 - (5*n - 3)*x^3)*D[P[n - 1, x], {x, 2}])/(4*n^3 - 10*n^2 + 8*n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((4*n^3 - 6*n^2 + 2*n + (7*n^3 - 16*n^2 + 7*n)*x)*v[i - 1] + ((12*n^2 + 10*n - 10)*x + (2*n^2 - 18*n + 10)*x^2)*deriv(v[i - 1], x) + ((20*n - 12)*x^2 - (5*n - 3)*x^3)*deriv(deriv(v[i - 1], x), x))/(4*n^3 - 10*n^2 + 8*n - 2)); 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: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
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) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
-
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
Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
-
from
reversal of Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
-
from
theta_plus_one of Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
Related ?
Same fingerprint ?
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