A086645 → basis A007318 → basis A008277
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-1 - 3\,x - x^{2}\right)\,P_{n-2}(x) + \left(-3\,x - 2\,x^{2}\right)\,P_{n-2}'(x) + \left(-x^{2}\right)\,P_{n-2}''(x) + \left(6 + 2\,x\right)\,P_{n-1}(x) + \left(2\,x\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 3 + x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 3 | 1 | 4 | ||||||
| 3 | 17 | 11 | 1 | 29 | |||||
| 4 | 99 | 109 | 24 | 1 | 233 | ||||
| 5 | 577 | 975 | 377 | 42 | 1 | 1972 | |||
| 6 | 3363 | 8221 | 4860 | 965 | 65 | 1 | 17475 | ||
| 7 | 19601 | 66863 | 56197 | 17014 | 2060 | 93 | 1 | 161829 | |
| 8 | 114243 | 531133 | 607488 | 258881 | 47698 | 3892 | 126 | 1 | 1563462 |
Compute more
?
Technical details
- Node id
n-2c86e6b32cde072a· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-3d718187357dc970
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: 3, 1; 3: 17, 11, 1; 4: 99, 109, 24, 1; 5: 577, 975, 377, 42, 1; 6: 3363, 8221, 4860, 965, 65, 1; 7: 19601, 66863, 56197, 17014, 2060, 93, 1; 8: 114243, 531133, 607488, 258881, 47698, 3892, 126, 1; 9: 665857, 4151295, 6277457, 3589082, 924711, 114646, 6734, 164, 1; 10: 3880899, 32074813, 62839860, 46698253, 15994251, 2760087, 246036, 10902, 207, 1;
%F FormulaThe row polynomials satisfy P(n,x) = -(1+3*x+x^2)*P(n-2,x) - (3*x+2*x^2)*d/dx P(n-2,x) - x^2*d^2/dx^2 P(n-2,x) + (6+2*x)*P(n-1,x) + 2*x*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 3 + x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 3 + x;
P[n_, x_] := P[n, x] = Expand[-(1 + 3*x + x^2)*P[n - 2, x] - (3*x + 2*x^2)*D[P[n - 2, x], x] - x^2*D[P[n - 2, x], {x, 2}] + (6 + 2*x)*P[n - 1, x] + 2*x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3 + x; for(n = 3, N, my(i = n); v[i] = -(1 + 3*x + x^2)*v[i - 2] - (3*x + 2*x^2)*deriv(v[i - 2], x) - x^2*deriv(deriv(v[i - 2], x), x) + (6 + 2*x)*v[i - 1] + 2*x*deriv(v[i - 1], x)); 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
derived from Ray basis map theorem
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Ray basis map theorem
Proof chains ? JSON
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
basis_map_A007318 of Triangle read by rows: T(n, k) = binomial(2n, 2k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) = binomial(2n, 2k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n, k) = binomial(2n, 2k).?
-
-
from
basis_map_A007318 of Triangle read by rows: T(n, k) = binomial(2n, 2k).?
References
- [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
- [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
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023