A063007 → basis A013610 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-75 - 27\,x + 27\,x^{2} + 156\,n + 27\,n x - 27\,n x^{2} - 108\,n^{2} + 27\,n^{3}\right)\,P_{n}(x) = \left(-27 - 45\,x + 81\,x^{2} + 162\,x^{3} + 108\,n + 207\,n x - 81\,n x^{2} - 162\,n x^{3} - 162\,n^{2} - 324\,n^{2} x + 81\,n^{3} + 162\,n^{3} x\right)\,P_{n-1}(x) + \left(28 + 90\,x - 72\,x^{2} - 324\,x^{3} - 162\,x^{4} - 72\,n - 324\,n x - 324\,n x^{2} + 36\,n^{2} + 162\,n^{2} x + 162\,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 | 9 | 6 | 15 | ||||||
| 3 | 67 | 162 | 54 | 283 | |||||
| 4 | 459 | 2016 | 2430 | 540 | 5445 | ||||
| 5 | 3021 | 19440 | 42390 | 34020 | 5670 | 104541 | |||
| 6 | 19413 | 165150 | 527310 | 763560 | 459270 | 61236 | 1995939 | ||
| 7 | 122767 | 1300698 | 5492340 | 11634840 | 12604410 | 6062364 | 673596 | 37891015 | |
| 8 | 767511 | 9740976 | 51254532 | 143564400 | 227338650 | 196690032 | 78810732 | 7505784 | 715672617 |
Compute more
?
Technical details
- Node id
n-af48e301204acbca· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-3160782481402e19
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: 9, 6; 3: 67, 162, 54; 4: 459, 2016, 2430, 540; 5: 3021, 19440, 42390, 34020, 5670; 6: 19413, 165150, 527310, 763560, 459270, 61236; 7: 122767, 1300698, 5492340, 11634840, 12604410, 6062364, 673596; 8: 767511, 9740976, 51254532, 143564400, 227338650, 196690032, 78810732, 7505784; 9: 4757017, 70376688, 443836260, 1549270800, 3242803410, 4098158064, 2951024076, 1013280840, 84440070; 10: 29285793, 494956710, 3640465620, 15233997240, 39733744050, 66349879596, 69747497820, 43008142320, 12919330710, 956987460;
%F FormulaThe row polynomials satisfy (27*n^3-108*n^2+156*n-75+(27*n-27)*x-(27*n-27)*x^2)*P(n,x) = (81*n^3-162*n^2+108*n-27+(162*n^3-324*n^2+207*n-45)*x-(81*n-81)*x^2-(162*n-162)*x^3)*P(n-1,x) + (36*n^2-72*n+28+(162*n^2-324*n+90)*x+(162*n^2-324*n-72)*x^2-324*x^3-162*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[((81*n^3 - 162*n^2 + 108*n - 27 + (162*n^3 - 324*n^2 + 207*n - 45)*x - (81*n - 81)*x^2 - (162*n - 162)*x^3)*P[n - 1, x] + (36*n^2 - 72*n + 28 + (162*n^2 - 324*n + 90)*x + (162*n^2 - 324*n - 72)*x^2 - 324*x^3 - 162*x^4)*D[P[n - 1, x], x])/(27*n^3 - 108*n^2 + 156*n - 75 + (27*n - 27)*x - (27*n - 27)*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] = ((81*n^3 - 162*n^2 + 108*n - 27 + (162*n^3 - 324*n^2 + 207*n - 45)*x - (81*n - 81)*x^2 - (162*n - 162)*x^3)*v[i - 1] + (36*n^2 - 72*n + 28 + (162*n^2 - 324*n + 90)*x + (162*n^2 - 324*n - 72)*x^2 - 324*x^3 - 162*x^4)*deriv(v[i - 1], x))/(27*n^3 - 108*n^2 + 156*n - 75 + (27*n - 27)*x - (27*n - 27)*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
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A013610 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
Geometric basis map (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) [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.?
- ↑ Three-term recurrence criterion (above)
- ↑ 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
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,…?
- ↑ 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,…?
- ↑ 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.?
-
Geometric basis map (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)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ 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.?
-
-
from
basis_map_A013610 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
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