A130534 → D → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-8 + 12\,x - 6\,x^{2} + x^{3} + 12\,n - 12\,n x + 3\,n x^{2} - 6\,n^{2} + 3\,n^{2} x + n^{3}\right)\,P_{n-3}(x) + \left(-7 + 9\,x - 3\,x^{2} + 9\,n - 6\,n x - 3\,n^{2}\right)\,P_{n-2}(x) + \left(-3 + 3\,x + 3\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 3 + 4\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 1 | 1 | |||||||||||||
| 2 | 3 | 4 | 7 | ||||||||||||
| 3 | 11 | 24 | 9 | 44 | |||||||||||
| 4 | 50 | 140 | 90 | 16 | 296 | ||||||||||
| 5 | 274 | 900 | 765 | 240 | 25 | 2204 | |||||||||
| 6 | 1764 | 6496 | 6615 | 2800 | 525 | 36 | 18236 | ||||||||
| 7 | 13068 | 52528 | 60921 | 31360 | 8050 | 1008 | 49 | 166984 | |||||||
| 8 | 109584 | 472496 | 605556 | 359184 | 113400 | 19656 | 1764 | 64 | 1681704 | ||||||
| 9 | 1026576 | 4690800 | 6513120 | 4309200 | 1581825 | 340200 | 42630 | 2880 | 81 | 18507312 | |||||
| 10 | 10628640 | 51014304 | 75685500 | 54670880 | 22551375 | 5679828 | 889350 | 84480 | 4455 | 100 | 221208912 | ||||
| 11 | 120543840 | 603671904 | 947322684 | 735931680 | 333488375 | 94952088 | 17513727 | 2090880 | 155925 | 6600 | 121 | 2855677824 | |||
| 12 | 1486442880 | 7726238208 | 12726133992 | 10515309376 | 5151753750 | 1619648316 | 339405066 | 47965632 | 4517370 | 271700 | 9438 | 144 | 39617695872 | ||
| 13 | 19802759040 | 106386868224 | 182823777864 | 159323260096 | 83402969650 | 28473953508 | 6616787177 | 1066857792 | 119432313 | 9109100 | 451451 | 13104 | 169 | 588026239488 | |
| 14 | 283465647360 | 1568627191296 | 2798903343600 | 2555545690880 | 1416584169000 | 518735625408 | 131391234975 | 23578343360 | 3022294275 | 274974700 | 17342325 | 720720 | 17745 | 196 | 9300146595840 |
Compute more
?
Technical details
- Node id
n-f61f4db50c767f03· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-1aa895cb27e2dde9
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, 4; 3: 11, 24, 9; 4: 50, 140, 90, 16; 5: 274, 900, 765, 240, 25; 6: 1764, 6496, 6615, 2800, 525, 36; 7: 13068, 52528, 60921, 31360, 8050, 1008, 49; 8: 109584, 472496, 605556, 359184, 113400, 19656, 1764, 64; 9: 1026576, 4690800, 6513120, 4309200, 1581825, 340200, 42630, 2880, 81;
%F FormulaThe row polynomials satisfy P(n,x) = (n^3-6*n^2+12*n-8+(3*n^2-12*n+12)*x+(3*n-6)*x^2+x^3)*P(n-3,x) - (3*n^2-9*n+7+(6*n-9)*x+3*x^2)*P(n-2,x) + (3*n-3+3*x)*P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 3 + 4*x.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[2, x_] := 3 + 4*x;
P[n_, x_] := P[n, x] = Expand[(n^3 - 6*n^2 + 12*n - 8 + (3*n^2 - 12*n + 12)*x + (3*n - 6)*x^2 + x^3)*P[n - 3, x] - (3*n^2 - 9*n + 7 + (6*n - 9)*x + 3*x^2)*P[n - 2, x] + (3*n - 3 + 3*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 + 4*x; for(n = 3, N, my(i = n + 1); v[i] = (n^3 - 6*n^2 + 12*n - 8 + (3*n^2 - 12*n + 12)*x + (3*n - 6)*x^2 + x^3)*v[i - 3] - (3*n^2 - 9*n + 7 + (6*n - 9)*x + 3*x^2)*v[i - 2] + (3*n - 3 + 3*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.