A102537 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-4\,n - 6\,n^{2} + 4\,n^{3}\right)\,P_{n}(x) = \left(-2 + 3\,x - 4\,n - 6\,n x + 2\,n^{2} - 15\,n^{2} x + 4\,n^{3} + 18\,n^{3} x\right)\,P_{n-1}(x) + \left(x + 3\,x^{2} - 9\,n x - 12\,n x^{2} + 8\,n^{2} x + 9\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 3\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 1 | 0 | |||||||
| 2 | 3 | 3 | ||||||
| 3 | 8 | 24 | 32 | |||||
| 4 | 15 | 110 | 165 | 290 | ||||
| 5 | 24 | 312 | 1092 | 1092 | 2520 | |||
| 6 | 35 | 700 | 4200 | 9520 | 7140 | 21595 | ||
| 7 | 48 | 1360 | 12240 | 46512 | 77520 | 46512 | 184192 | |
| 8 | 63 | 2394 | 29925 | 167580 | 460845 | 605682 | 302841 | 1569330 |
Compute more
?
Technical details
- Node id
n-0c55154f23bf06d5· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-8ea5ea86212c3689
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: 3; 3: 8, 24; 4: 15, 110, 165; 5: 24, 312, 1092, 1092; 6: 35, 700, 4200, 9520, 7140; 7: 48, 1360, 12240, 46512, 77520, 46512; 8: 63, 2394, 29925, 167580, 460845, 605682, 302841; 9: 80, 3920, 64680, 495880, 1983520, 4250400, 4604600, 1973400; 10: 99, 6072, 127512, 1275120, 6906900, 21312720, 37297260, 34337160, 12876435;
%F FormulaThe row polynomials satisfy (4*n^3-6*n^2-4*n)*P(n,x) = (4*n^3+2*n^2-4*n-2+(18*n^3-15*n^2-6*n+3)*x)*P(n-1,x) + ((8*n^2-9*n+1)*x+(9*n^2-12*n+3)*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 3.
%t MathematicaP[1, x_] := 0;
P[2, x_] := 3;
P[n_, x_] := P[n, x] = Expand[Together[((4*n^3 + 2*n^2 - 4*n - 2 + (18*n^3 - 15*n^2 - 6*n + 3)*x)*P[n - 1, x] + ((8*n^2 - 9*n + 1)*x + (9*n^2 - 12*n + 3)*x^2)*D[P[n - 1, x], x])/(4*n^3 - 6*n^2 - 4*n)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 0; v[2] = 3; for(n = 3, N, my(i = n); v[i] = ((4*n^3 + 2*n^2 - 4*n - 2 + (18*n^3 - 15*n^2 - 6*n + 3)*x)*v[i - 1] + ((8*n^2 - 9*n + 1)*x + (9*n^2 - 12*n + 3)*x^2)*deriv(v[i - 1], x))/(4*n^3 - 6*n^2 - 4*n)); 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
Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: the reversed x = 1+q Narayana triangle at m=2.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 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
-
from
Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 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
Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k middle edges (n >= 0, k >= 0).?
-
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) is the number of ternary trees with n edges and having k middle edges (n >= 0, k >= 0).?
-
from
Triangle read by rows: the reversed x = 1+q Narayana triangle at m=2.?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 1.?
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.