A104684 → D → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-12 + 16\,x + 20\,n - 32\,n x - 11\,n^{2} + 24\,n^{2} x + 2\,n^{3} - 8\,n^{3} x + n^{4} x\right)\,P_{n}(x) = \left(-36 - 18\,x + 16\,x^{2} + 66\,n + 12\,n x - 46\,n x^{2} - 40\,n^{2} + 18\,n^{2} x + 47\,n^{2} x^{2} + 8\,n^{3} - 18\,n^{3} x - 20\,n^{3} x^{2} + 4\,n^{4} x + 3\,n^{4} x^{2}\right)\,P_{n-1}(x) + \left(-9\,x - 5\,x^{2} + 4\,x^{3} + 12\,n x + 2\,n x^{2} - 10\,n x^{3} - 4\,n^{2} x + 4\,n^{2} x^{2} + 8\,n^{2} x^{3} - 2\,n^{3} x^{2} - 2\,n^{3} x^{3}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 1 | 0 | |||||||
| 2 | 1 | 1 | ||||||
| 3 | 6 | 4 | 10 | |||||
| 4 | 30 | 48 | 9 | 87 | ||||
| 5 | 140 | 360 | 180 | 16 | 696 | |||
| 6 | 630 | 2240 | 1890 | 480 | 25 | 5265 | ||
| 7 | 2772 | 12600 | 15120 | 6720 | 1050 | 36 | 38298 | |
| 8 | 12012 | 66528 | 103950 | 67200 | 18900 | 2016 | 49 | 270655 |
Compute more
?
Technical details
- Node id
n-3b76d56c9dfaad44· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-980e267510c7a2f6
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 -2)
- 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: 0; 2: 1; 3: 6, 4; 4: 30, 48, 9; 5: 140, 360, 180, 16; 6: 630, 2240, 1890, 480, 25; 7: 2772, 12600, 15120, 6720, 1050, 36; 8: 12012, 66528, 103950, 67200, 18900, 2016, 49; 9: 51480, 336336, 648648, 554400, 231000, 45360, 3528, 64; 10: 218790, 1647360, 3783780, 4036032, 2252250, 665280, 97020, 5760, 81;
%F FormulaThe row polynomials satisfy (2*n^3-11*n^2+20*n-12+(n^4-8*n^3+24*n^2-32*n+16)*x)*P(n,x) = (8*n^3-40*n^2+66*n-36+(4*n^4-18*n^3+18*n^2+12*n-18)*x+(3*n^4-20*n^3+47*n^2-46*n+16)*x^2)*P(n-1,x) - ((4*n^2-12*n+9)*x+(2*n^3-4*n^2-2*n+5)*x^2+(2*n^3-8*n^2+10*n-4)*x^3)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 1.
%t MathematicaP[1, x_] := 0;
P[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((8*n^3 - 40*n^2 + 66*n - 36 + (4*n^4 - 18*n^3 + 18*n^2 + 12*n - 18)*x + (3*n^4 - 20*n^3 + 47*n^2 - 46*n + 16)*x^2)*P[n - 1, x] - ((4*n^2 - 12*n + 9)*x + (2*n^3 - 4*n^2 - 2*n + 5)*x^2 + (2*n^3 - 8*n^2 + 10*n - 4)*x^3)*D[P[n - 1, x], x])/(2*n^3 - 11*n^2 + 20*n - 12 + (n^4 - 8*n^3 + 24*n^2 - 32*n + 16)*x)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 0; v[2] = 1; for(n = 3, N, my(i = n); v[i] = ((8*n^3 - 40*n^2 + 66*n - 36 + (4*n^4 - 18*n^3 + 18*n^2 + 12*n - 18)*x + (3*n^4 - 20*n^3 + 47*n^2 - 46*n + 16)*x^2)*v[i - 1] - ((4*n^2 - 12*n + 9)*x + (2*n^3 - 4*n^2 - 2*n + 5)*x^2 + (2*n^3 - 8*n^2 + 10*n - 4)*x^3)*deriv(v[i - 1], x))/(2*n^3 - 11*n^2 + 20*n - 12 + (n^4 - 8*n^3 + 24*n^2 - 32*n + 16)*x)); 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
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
derivative of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
-
from
derivative of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(…?
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