A104684 → basis A013610 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-12 + 27\,x - 27\,x^{2} + 12\,n - 63\,n x + 81\,n x^{2} + 36\,n^{2} x - 81\,n^{2} x^{2} + 27\,n^{3} x^{2}\right)\,P_{n}(x) = \left(-132 + 81\,x + 513\,x^{2} + 162\,x^{3} + 84\,n - 513\,n x - 783\,n x^{2} + 162\,n x^{3} + 288\,n^{2} x - 27\,n^{2} x^{2} - 567\,n^{2} x^{3} + 189\,n^{3} x^{2} + 243\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-8 + 144\,x^{2} + 243\,x^{3} + 81\,x^{4} - 48\,n x - 198\,n x^{2} - 135\,n x^{3} + 81\,n x^{4} - 36\,n^{2} x^{2} - 162\,n^{2} x^{3} - 162\,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 | 3 | 6 | 9 | ||||||
| 3 | 13 | 48 | 27 | 88 | |||||
| 4 | 63 | 342 | 405 | 108 | 918 | ||||
| 5 | 321 | 2304 | 4212 | 2592 | 405 | 9834 | |||
| 6 | 1683 | 15030 | 37260 | 36720 | 14175 | 1458 | 106326 | ||
| 7 | 8989 | 96048 | 300915 | 410400 | 261225 | 69984 | 5103 | 1152664 | |
| 8 | 48639 | 605094 | 2292381 | 4003020 | 3586275 | 1622754 | 321489 | 17496 | 12497148 |
Compute more
?
Technical details
- Node id
n-b213ae83c910518e· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-9f5cd98eb75e902b
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: 3, 6; 3: 13, 48, 27; 4: 63, 342, 405, 108; 5: 321, 2304, 4212, 2592, 405; 6: 1683, 15030, 37260, 36720, 14175, 1458; 7: 8989, 96048, 300915, 410400, 261225, 69984, 5103; 8: 48639, 605094, 2292381, 4003020, 3586275, 1622754, 321489, 17496; 9: 265729, 3772416, 16768080, 35731584, 41447700, 26780544, 9144576, 1399680, 59049; 10: 1462563, 23331942, 119038896, 299630016, 427529340, 361169928, 178319232, 47869056, 5845851, 196830;
%F FormulaThe row polynomials satisfy (12*n-12+(36*n^2-63*n+27)*x+(27*n^3-81*n^2+81*n-27)*x^2)*P(n,x) = (84*n-132+(288*n^2-513*n+81)*x+(189*n^3-27*n^2-783*n+513)*x^2+(243*n^3-567*n^2+162*n+162)*x^3)*P(n-1,x) - (8+48*n*x+(36*n^2+198*n-144)*x^2+(162*n^2+135*n-243)*x^3+(162*n^2-81*n-81)*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[((84*n - 132 + (288*n^2 - 513*n + 81)*x + (189*n^3 - 27*n^2 - 783*n + 513)*x^2 + (243*n^3 - 567*n^2 + 162*n + 162)*x^3)*P[n - 1, x] - (8 + 48*n*x + (36*n^2 + 198*n - 144)*x^2 + (162*n^2 + 135*n - 243)*x^3 + (162*n^2 - 81*n - 81)*x^4)*D[P[n - 1, x], x])/(12*n - 12 + (36*n^2 - 63*n + 27)*x + (27*n^3 - 81*n^2 + 81*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] = ((84*n - 132 + (288*n^2 - 513*n + 81)*x + (189*n^3 - 27*n^2 - 783*n + 513)*x^2 + (243*n^3 - 567*n^2 + 162*n + 162)*x^3)*v[i - 1] - (8 + 48*n*x + (36*n^2 + 198*n - 144)*x^2 + (162*n^2 + 135*n - 243)*x^3 + (162*n^2 - 81*n - 81)*x^4)*deriv(v[i - 1], x))/(12*n - 12 + (36*n^2 - 63*n + 27)*x + (27*n^3 - 81*n^2 + 81*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 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
basis_map_A013610 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_A013610 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
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