A130534 → D → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-81 + 108\,x - 54\,x^{2} + 12\,x^{3} - x^{4} + 108\,n - 108\,n x + 36\,n x^{2} - 4\,n x^{3} - 54\,n^{2} + 36\,n^{2} x - 6\,n^{2} x^{2} + 12\,n^{3} - 4\,n^{3} x - n^{4}\right)\,P_{n-4}(x) + \left(-65 + 76\,x - 30\,x^{2} + 4\,x^{3} + 76\,n - 60\,n x + 12\,n x^{2} - 30\,n^{2} + 12\,n^{2} x + 4\,n^{3}\right)\,P_{n-3}(x) + \left(-25 + 24\,x - 6\,x^{2} + 24\,n - 12\,n x - 6\,n^{2}\right)\,P_{n-2}(x) + \left(-6 + 4\,x + 4\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 3 + 8\,x\)
\(P_{3}(x) = 11 + 48\,x + 27\,x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 1 | 1 | ||||||
| 2 | 3 | 8 | 11 | |||||
| 3 | 11 | 48 | 27 | 86 | ||||
| 4 | 50 | 280 | 270 | 64 | 664 | |||
| 5 | 274 | 1800 | 2295 | 960 | 125 | 5454 | ||
| 6 | 1764 | 12992 | 19845 | 11200 | 2625 | 216 | 48642 | |
| 7 | 13068 | 105056 | 182763 | 125440 | 40250 | 6048 | 343 | 472968 |
Compute more
?
Technical details
- Node id
n-b7c4a9cec98c1a71· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-638cb76645443454
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 0; 1: 1; 2: 3, 8; 3: 11, 48, 27; 4: 50, 280, 270, 64; 5: 274, 1800, 2295, 960, 125; 6: 1764, 12992, 19845, 11200, 2625, 216; 7: 13068, 105056, 182763, 125440, 40250, 6048, 343; 8: 109584, 944992, 1816668, 1436736, 567000, 117936, 12348, 512; 9: 1026576, 9381600, 19539360, 17236800, 7909125, 2041200, 298410, 23040, 729;
%F FormulaThe row polynomials satisfy P(n,x) = -(n^4-12*n^3+54*n^2-108*n+81+(4*n^3-36*n^2+108*n-108)*x+(6*n^2-36*n+54)*x^2+(4*n-12)*x^3+x^4)*P(n-4,x) + (4*n^3-30*n^2+76*n-65+(12*n^2-60*n+76)*x+(12*n-30)*x^2+4*x^3)*P(n-3,x) - (6*n^2-24*n+25+(12*n-24)*x+6*x^2)*P(n-2,x) + (4*n-6+4*x)*P(n-1,x) for n >= 4, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 3 + 8*x, P(3,x) = 11 + 48*x + 27*x^2.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[2, x_] := 3 + 8*x;
P[3, x_] := 11 + 48*x + 27*x^2;
P[n_, x_] := P[n, x] = Expand[-(n^4 - 12*n^3 + 54*n^2 - 108*n + 81 + (4*n^3 - 36*n^2 + 108*n - 108)*x + (6*n^2 - 36*n + 54)*x^2 + (4*n - 12)*x^3 + x^4)*P[n - 4, x] + (4*n^3 - 30*n^2 + 76*n - 65 + (12*n^2 - 60*n + 76)*x + (12*n - 30)*x^2 + 4*x^3)*P[n - 3, x] - (6*n^2 - 24*n + 25 + (12*n - 24)*x + 6*x^2)*P[n - 2, x] + (4*n - 6 + 4*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; v[3] = 3 + 8*x; v[4] = 11 + 48*x + 27*x^2; for(n = 4, N, my(i = n + 1); v[i] = -(n^4 - 12*n^3 + 54*n^2 - 108*n + 81 + (4*n^3 - 36*n^2 + 108*n - 108)*x + (6*n^2 - 36*n + 54)*x^2 + (4*n - 12)*x^3 + x^4)*v[i - 4] + (4*n^3 - 30*n^2 + 76*n - 65 + (12*n^2 - 60*n + 76)*x + (12*n - 30)*x^2 + 4*x^3)*v[i - 3] - (6*n^2 - 24*n + 25 + (12*n - 24)*x + 6*x^2)*v[i - 2] + (4*n - 6 + 4*x)*v[i - 1]); 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 multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
derivative of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), exp…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Liu–Wang theorem (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
derivative of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), exp…?
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
- [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.