A130534 → Veronese 2 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-81 + 36\,x + 9\,x^{2} + 108\,n - 24\,n x - 54\,n^{2} + 4\,n^{2} x + 12\,n^{3} - n^{4}\right)\,P_{n-4}(x) + \left(-36\,x^{2} + 4\,x^{3} + 24\,n x^{2} - 4\,n^{2} x^{2}\right)\,P_{n-4}'(x) + \left(-65 + 20\,x + 76\,n - 8\,n x - 30\,n^{2} + 4\,n^{3}\right)\,P_{n-3}(x) + \left(-20\,x^{2} + 8\,n x^{2}\right)\,P_{n-3}'(x) + \left(-25 + 4\,x + 24\,n - 6\,n^{2}\right)\,P_{n-2}(x) + \left(-4\,x^{2}\right)\,P_{n-2}'(x) + \left(-6 + 4\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 2 + 4\,x\)
\(P_{3}(x) = 6 + 24\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 1 | 1 | |||||||
| 2 | 2 | 4 | 6 | ||||||
| 3 | 6 | 24 | 30 | ||||||
| 4 | 24 | 140 | 9 | 173 | |||||
| 5 | 120 | 900 | 135 | 1155 | |||||
| 6 | 720 | 6496 | 1575 | 16 | 8807 | ||||
| 7 | 5040 | 52528 | 17640 | 448 | 75656 | ||||
| 8 | 40320 | 472496 | 202041 | 8736 | 25 | 723618 | |||
| 9 | 362880 | 4690800 | 2423925 | 151200 | 1125 | 7629930 | |||
| 10 | 3628800 | 51014304 | 30752370 | 2524368 | 33000 | 36 | 87952878 | ||
| 11 | 39916800 | 603671904 | 413961570 | 42200928 | 816750 | 2376 | 1100570328 | ||
| 12 | 479001600 | 7726238208 | 5914861524 | 719843696 | 18736575 | 97812 | 49 | 14858779464 | |
| 13 | 6227020800 | 106386868224 | 89619333804 | 12655090448 | 416741325 | 3279276 | 4459 | 215308338336 | |
| 14 | 87178291200 | 1568627191296 | 1437494451120 | 230549166848 | 9210290375 | 98990892 | 245245 | 64 | 3333158627040 |
Compute more
?
Technical details
- Node id
n-f0a112d8bb68d045· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-72fed22386e65f36
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: 2, 4; 3: 6, 24; 4: 24, 140, 9; 5: 120, 900, 135; 6: 720, 6496, 1575, 16; 7: 5040, 52528, 17640, 448; 8: 40320, 472496, 202041, 8736, 25; 9: 362880, 4690800, 2423925, 151200, 1125;
%F FormulaThe row polynomials satisfy P(n,x) = -(n^4-12*n^3+54*n^2-108*n+81-(4*n^2-24*n+36)*x-9*x^2)*P(n-4,x) - ((4*n^2-24*n+36)*x^2-4*x^3)*d/dx P(n-4,x) + (4*n^3-30*n^2+76*n-65-(8*n-20)*x)*P(n-3,x) + (8*n-20)*x^2*d/dx P(n-3,x) - (6*n^2-24*n+25-4*x)*P(n-2,x) - 4*x^2*d/dx P(n-2,x) + (4*n-6)*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 1, P(2,x) = 2 + 4*x, P(3,x) = 6 + 24*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1;
P[2, x_] := 2 + 4*x;
P[3, x_] := 6 + 24*x;
P[n_, x_] := P[n, x] = Expand[-(n^4 - 12*n^3 + 54*n^2 - 108*n + 81 - (4*n^2 - 24*n + 36)*x - 9*x^2)*P[n - 4, x] - ((4*n^2 - 24*n + 36)*x^2 - 4*x^3)*D[P[n - 4, x], x] + (4*n^3 - 30*n^2 + 76*n - 65 - (8*n - 20)*x)*P[n - 3, x] + (8*n - 20)*x^2*D[P[n - 3, x], x] - (6*n^2 - 24*n + 25 - 4*x)*P[n - 2, x] - 4*x^2*D[P[n - 2, x], x] + (4*n - 6)*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] = 1; v[2] = 1; v[3] = 2 + 4*x; v[4] = 6 + 24*x; for(n = 4, N, my(i = n + 1); v[i] = -(n^4 - 12*n^3 + 54*n^2 - 108*n + 81 - (4*n^2 - 24*n + 36)*x - 9*x^2)*v[i - 4] - ((4*n^2 - 24*n + 36)*x^2 - 4*x^3)*deriv(v[i - 4], x) + (4*n^3 - 30*n^2 + 76*n - 65 - (8*n - 20)*x)*v[i - 3] + (8*n - 20)*x^2*deriv(v[i - 3], x) - (6*n^2 - 24*n + 25 - 4*x)*v[i - 2] - 4*x^2*deriv(v[i - 2], x) + (4*n - 6)*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
veronese_section_2_0 of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...…?
-
Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] 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…?
-
-
from
veronese_section_2_0 of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...…?
Related ?
Same fingerprint ?
References
- [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
- [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
- [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
- [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
- [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.