A111125 → basis A013611 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(120 + 192\,x - 384\,x^{2} - 80\,n - 128\,n x + 832\,n x^{2} - 576\,n^{2} x^{2} + 128\,n^{3} x^{2}\right)\,P_{n}(x) = \left(80 + 288\,x + 256\,x^{2} - 120\,n - 272\,n x + 256\,n x^{2} + 512\,n x^{3} - 80\,n^{2} x - 704\,n^{2} x^{2} - 768\,n^{2} x^{3} + 192\,n^{3} x^{2} + 256\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-25 - 200\,x - 464\,x^{2} - 256\,x^{3} - 160\,n x^{2} - 768\,n x^{3} - 512\,n x^{4} + 80\,n^{2} x^{2} + 384\,n^{2} x^{3} + 256\,n^{2} x^{4}\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 | 4 | 8 | 12 | ||||||
| 3 | 11 | 56 | 48 | 115 | |||||
| 4 | 29 | 248 | 480 | 256 | 1013 | ||||
| 5 | 76 | 920 | 2880 | 3328 | 1280 | 8484 | |||
| 6 | 199 | 3120 | 13680 | 25088 | 20480 | 6144 | 68711 | ||
| 7 | 521 | 10032 | 56880 | 144896 | 185600 | 116736 | 28672 | 543337 | |
| 8 | 1364 | 31144 | 217152 | 712960 | 1260800 | 1234944 | 630784 | 131072 | 4220220 |
Compute more
?
Technical details
- Node id
n-4f5b30e5043fd166· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-c7d6d1540a0cf547
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: 4, 8; 3: 11, 56, 48; 4: 29, 248, 480, 256; 5: 76, 920, 2880, 3328, 1280; 6: 199, 3120, 13680, 25088, 20480, 6144; 7: 521, 10032, 56880, 144896, 185600, 116736, 28672; 8: 1364, 31144, 217152, 712960, 1260800, 1234944, 630784, 131072; 9: 3571, 94312, 781440, 3152128, 7161600, 9639936, 7626752, 3276800, 589824; 10: 9349, 280360, 2693040, 12911104, 35984640, 62060544, 67235840, 44564480, 16515072, 2621440;
%F FormulaThe row polynomials satisfy -(80*n-120+(128*n-192)*x-(128*n^3-576*n^2+832*n-384)*x^2)*P(n,x) = -(120*n-80+(80*n^2+272*n-288)*x-(192*n^3-704*n^2+256*n+256)*x^2-(256*n^3-768*n^2+512*n)*x^3)*P(n-1,x) - (25+200*x-(80*n^2-160*n-464)*x^2-(384*n^2-768*n-256)*x^3-(256*n^2-512*n)*x^4)*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[Together[(-(120*n - 80 + (80*n^2 + 272*n - 288)*x - (192*n^3 - 704*n^2 + 256*n + 256)*x^2 - (256*n^3 - 768*n^2 + 512*n)*x^3)*P[n - 1, x] - (25 + 200*x - (80*n^2 - 160*n - 464)*x^2 - (384*n^2 - 768*n - 256)*x^3 - (256*n^2 - 512*n)*x^4)*D[P[n - 1, x], x])/(-80*n + 120 - (128*n - 192)*x + (128*n^3 - 576*n^2 + 832*n - 384)*x^2)]];
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] = (-(120*n - 80 + (80*n^2 + 272*n - 288)*x - (192*n^3 - 704*n^2 + 256*n + 256)*x^2 - (256*n^3 - 768*n^2 + 512*n)*x^3)*v[i - 1] - (25 + 200*x - (80*n^2 - 160*n - 464)*x^2 - (384*n^2 - 768*n - 256)*x^3 - (256*n^2 - 512*n)*x^4)*deriv(v[i - 1], x))/(-80*n + 120 - (128*n - 192)*x + (128*n^3 - 576*n^2 + 832*n - 384)*x^2)); 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
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A013611 of Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.?
-
-
from
basis_map_A013611 of Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.?
References
- [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
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [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.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023