A104684 → basis A013611 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-15 + 34\,x - 8\,x^{2} + 39\,n - 50\,n x + 8\,n x^{2} - 32\,n^{2} + 16\,n^{2} x + 8\,n^{3}\right)\,P_{n}(x) = \left(-17 + 242\,x + 432\,x^{2} - 160\,x^{3} + 197\,n + 30\,n x - 576\,n x^{2} + 96\,n x^{3} - 208\,n^{2} - 272\,n^{2} x + 192\,n^{2} x^{2} + 56\,n^{3} + 96\,n^{3} x\right)\,P_{n-1}(x) + \left(-1 + 12\,x + 92\,x^{2} + 96\,x^{3} - 64\,x^{4} + 12\,n + 56\,n x - 128\,n x^{3} - 8\,n^{2} - 48\,n^{2} x - 64\,n^{2} x^{2}\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 | 7 | 4 | 11 | ||||||
| 3 | 45 | 64 | 16 | 125 | |||||
| 4 | 291 | 708 | 432 | 64 | 1495 | ||||
| 5 | 1857 | 6528 | 7104 | 2560 | 256 | 18305 | |||
| 6 | 11703 | 54180 | 87360 | 57600 | 14080 | 1024 | 225947 | ||
| 7 | 73021 | 420672 | 907920 | 903680 | 410880 | 73728 | 4096 | 2793997 | |
| 8 | 452035 | 3120292 | 8474928 | 11439680 | 7965440 | 2688000 | 372736 | 16384 | 34529495 |
Compute more
?
Technical details
- Node id
n-bb87b1209ecaa616· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-56becc4b901ca19b
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: 7, 4; 3: 45, 64, 16; 4: 291, 708, 432, 64; 5: 1857, 6528, 7104, 2560, 256; 6: 11703, 54180, 87360, 57600, 14080, 1024; 7: 73021, 420672, 907920, 903680, 410880, 73728, 4096; 8: 452035, 3120292, 8474928, 11439680, 7965440, 2688000, 372736, 16384; 9: 2780673, 22388224, 73459456, 125970432, 120243200, 62849024, 16515072, 1835008, 65536; 10: 17017191, 156637764, 603217152, 1258521600, 1538546688, 1112444928, 456916992, 96731136, 8847360, 262144;
%F FormulaThe row polynomials satisfy (8*n^3-32*n^2+39*n-15+(16*n^2-50*n+34)*x+(8*n-8)*x^2)*P(n,x) = (56*n^3-208*n^2+197*n-17+(96*n^3-272*n^2+30*n+242)*x+(192*n^2-576*n+432)*x^2+(96*n-160)*x^3)*P(n-1,x) - (8*n^2-12*n+1+(48*n^2-56*n-12)*x+(64*n^2-92)*x^2+(128*n-96)*x^3+64*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[((56*n^3 - 208*n^2 + 197*n - 17 + (96*n^3 - 272*n^2 + 30*n + 242)*x + (192*n^2 - 576*n + 432)*x^2 + (96*n - 160)*x^3)*P[n - 1, x] - (8*n^2 - 12*n + 1 + (48*n^2 - 56*n - 12)*x + (64*n^2 - 92)*x^2 + (128*n - 96)*x^3 + 64*x^4)*D[P[n - 1, x], x])/(8*n^3 - 32*n^2 + 39*n - 15 + (16*n^2 - 50*n + 34)*x + (8*n - 8)*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] = ((56*n^3 - 208*n^2 + 197*n - 17 + (96*n^3 - 272*n^2 + 30*n + 242)*x + (192*n^2 - 576*n + 432)*x^2 + (96*n - 160)*x^3)*v[i - 1] - (8*n^2 - 12*n + 1 + (48*n^2 - 56*n - 12)*x + (64*n^2 - 92)*x^2 + (128*n - 96)*x^3 + 64*x^4)*deriv(v[i - 1], x))/(8*n^3 - 32*n^2 + 39*n - 15 + (16*n^2 - 50*n + 34)*x + (8*n - 8)*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 differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A013611 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
-
Geometric basis map (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) [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,…?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013611 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
Related ?
Same fingerprint ?
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