A154602 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(1 - 3\,x - 4\,x^{2} + 2\,n x + 2\,n x^{2}\right)\,P_{n-1}(x) + \left(-2\,x^{2} - 2\,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 | 1 | 1 | 2 | ||||||
| 3 | 1 | 4 | 3 | 8 | |||||
| 4 | 1 | 9 | 19 | 11 | 40 | ||||
| 5 | 1 | 16 | 70 | 104 | 49 | 240 | |||
| 6 | 1 | 25 | 190 | 550 | 641 | 257 | 1664 | ||
| 7 | 1 | 36 | 425 | 2080 | 4531 | 4380 | 1539 | 12992 | |
| 8 | 1 | 49 | 833 | 6265 | 22491 | 39515 | 32803 | 10299 | 112256 |
Compute more
?
Technical details
- Node id
n-985f1a76b6ca48a8· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-b3b7fb695f9c1be8
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: 1, 1; 3: 1, 4, 3; 4: 1, 9, 19, 11; 5: 1, 16, 70, 104, 49; 6: 1, 25, 190, 550, 641, 257; 7: 1, 36, 425, 2080, 4531, 4380, 1539; 8: 1, 49, 833, 6265, 22491, 39515, 32803, 10299; 9: 1, 64, 1484, 16016, 87206, 247072, 365324, 266768, 75905; 10: 1, 81, 2460, 36204, 281190, 1192086, 2792476, 3575820, 2337505, 609441;
%F FormulaThe row polynomials satisfy P(n,x) = (1+(2*n-3)*x+(2*n-4)*x^2)*P(n-1,x) - (2*x^2+2*x^3)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + (2*n - 3)*x + (2*n - 4)*x^2)*P[n - 1, x] - (2*x^2 + 2*x^3)*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; for(n = 2, N, my(i = n); v[i] = (1 + (2*n - 3)*x + (2*n - 4)*x^2)*v[i - 1] - (2*x^2 + 2*x^3)*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
- 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 ›
Related ?
Same fingerprint ?
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [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
- [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.