A145324 → basis A013609 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(n\right)\,P_{n}(x) = \left(-1 - 3\,n - 4\,n x - 3\,n^{2} - 8\,n^{2} x - 4\,n^{2} x^{2} - n^{3} - 4\,n^{3} x - 4\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(1 + 4\,n + 4\,n x + 2\,n^{2} + 4\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 4\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 4 | 4 | |||||||||||||
| 2 | 34 | 48 | 82 | ||||||||||||
| 3 | 266 | 784 | 576 | 1626 | |||||||||||
| 4 | 2196 | 10024 | 15216 | 7680 | 35116 | ||||||||||
| 5 | 19692 | 122872 | 286944 | 297216 | 115200 | 841924 | |||||||||
| 6 | 192816 | 1534352 | 4875864 | 7734016 | 6122880 | 1935360 | 22395288 | ||||||||
| 7 | 2057904 | 19979280 | 80707224 | 173624576 | 209786240 | 134977536 | 36126720 | 657259480 | |||||||
| 8 | 23844960 | 273877344 | 1346512800 | 3673219136 | 6004415360 | 5881158144 | 3195795456 | 743178240 | 21142001440 | ||||||
| 9 | 298582560 | 3966449184 | 23027961120 | 76312418496 | 157879047360 | 208798708224 | 172380773376 | 81221713920 | 16721510400 | 740607164640 | |||||
| 10 | 4022075520 | 60735022848 | 407228356512 | 1591235881472 | 3993140076960 | 6673591348992 | 7427736124928 | 5308805726208 | 2210895544320 | 408748032000 | 28086138189760 | ||||
| 11 | 58035000960 | 982614921984 | 7480429457184 | 33717373867520 | 99647897444640 | 201759121753344 | 283421127395840 | 272746665295872 | 172079396683776 | 64270938931200 | 10790948044800 | 1146954548797120 | |||
| 12 | 893441283840 | 16774428957696 | 143047994357952 | 731364788660992 | 2490885214919360 | 5933642104819584 | 10087922476726528 | 12240109671047168 | 10386951513477120 | 5870975715901440 | 1989222126059520 | 306070526361600 | 50197860002572800 | ||
| 13 | 14622115334400 | 301649146260480 | 2850245931592512 | 16310930285945088 | 62961045826925120 | 172698374793584256 | 345151145908337664 | 506415164320956416 | 541367727340142592 | 411214238380032000 | 210664383940657152 | 65352751927787520 | 9284139299635200 | 2344586419217190400 | |
| 14 | 253568960870400 | 5703713260231680 | 59178146487201792 | 374984721838821888 | 1619036618953742720 | 5029771646466652416 | 11566861452308851584 | 19936396203135451136 | 25753395433274560512 | 24625018725418598400 | 16940700009591570432 | 7940114777993379840 | 2272510666447257600 | 299949115834368000 | 116423874799971558400 |
Compute more
?
Technical details
- Node id
n-b045d4d1d6148fbd· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-e7900e406f467c81
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: 4; 2: 34, 48; 3: 266, 784, 576; 4: 2196, 10024, 15216, 7680; 5: 19692, 122872, 286944, 297216, 115200; 6: 192816, 1534352, 4875864, 7734016, 6122880, 1935360; 7: 2057904, 19979280, 80707224, 173624576, 209786240, 134977536, 36126720; 8: 23844960, 273877344, 1346512800, 3673219136, 6004415360, 5881158144, 3195795456, 743178240; 9: 298582560, 3966449184, 23027961120, 76312418496, 157879047360, 208798708224, 172380773376, 81221713920, 16721510400;
%F FormulaThe row polynomials satisfy n*P(n,x) = -(n^3+3*n^2+3*n+1+(4*n^3+8*n^2+4*n)*x+(4*n^3+4*n^2)*x^2)*P(n-2,x) + (2*n^2+4*n+1+(4*n^2+4*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 4.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 4;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 + 3*n^2 + 3*n + 1 + (4*n^3 + 8*n^2 + 4*n)*x + (4*n^3 + 4*n^2)*x^2)*P[n - 2, x] + (2*n^2 + 4*n + 1 + (4*n^2 + 4*n)*x)*P[n - 1, x])/(n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 4; for(n = 2, N, my(i = n + 1); v[i] = (-(n^3 + 3*n^2 + 3*n + 1 + (4*n^3 + 8*n^2 + 4*n)*x + (4*n^3 + 4*n^2)*x^2)*v[i - 2] + (2*n^2 + 4*n + 1 + (4*n^2 + 4*n)*x)*v[i - 1])/(n)); 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 differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A013609 of Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (-1)^(n+k)*Sum_{j=1..k} s(n,j), where s(n,j) are the signed Stirling numbers of the fir…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
- ↑ 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…?
-
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…?
-
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 ›
- ↑ 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…?
- ↑ 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) polytool ? step ›
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
Geometric basis map (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) (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
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…?
-
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) (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…?
-
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) (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…?
-
from
Triangle read by rows: T(n,k) = (-1)^(n+k)*Sum_{j=1..k} s(n,j), where s(n,j) are the signed Stirling numbers of the fir…?
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
-
from
basis_map_A013609 of Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
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.