A100861 → D → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-4 - 4\,x + 2\,n + 8\,n x - 5\,n^{2} x + n^{3} x\right)\,P_{n}(x) = \left(2\,n - 10\,n x + n^{2} x + 3\,n^{2} x^{2} + n^{3} x - 4\,n^{3} x^{2} + n^{4} x^{2}\right)\,P_{n-1}(x) + \left(-4\,n x^{2} + 2\,n^{2} x^{3} - 2\,n^{3} x^{3}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 0 | |||||||
| 2 | 1 | 1 | ||||||
| 3 | 3 | 3 | ||||||
| 4 | 6 | 12 | 18 | |||||
| 5 | 10 | 60 | 70 | |||||
| 6 | 15 | 180 | 135 | 330 | ||||
| 7 | 21 | 420 | 945 | 1386 | ||||
| 8 | 28 | 840 | 3780 | 1680 | 6328 | |||
| 9 | 36 | 1512 | 11340 | 15120 | 28008 | |||
| 10 | 45 | 2520 | 28350 | 75600 | 23625 | 130140 | ||
| 11 | 55 | 3960 | 62370 | 277200 | 259875 | 603460 | ||
| 12 | 66 | 5940 | 124740 | 831600 | 1559250 | 374220 | 2895816 | |
| 13 | 78 | 8580 | 231660 | 2162160 | 6756750 | 4864860 | 14024088 | |
| 14 | 91 | 12012 | 405405 | 5045040 | 23648625 | 34054020 | 6621615 | 69786808 |
Compute more
?
Technical details
- Node id
n-bdbb8cd6d1284c93· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-55c35b9641c5f83c
Observed on the stored rows ?
- Degrees: -1, -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6 (half 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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 0; 1: 0; 2: 1; 3: 3; 4: 6, 12; 5: 10, 60; 6: 15, 180, 135; 7: 21, 420, 945; 8: 28, 840, 3780, 1680; 9: 36, 1512, 11340, 15120;
%F FormulaThe row polynomials satisfy (2*n-4+(n^3-5*n^2+8*n-4)*x)*P(n,x) = (2*n+(n^3+n^2-10*n)*x+(n^4-4*n^3+3*n^2)*x^2)*P(n-1,x) - (4*n*x^2+(2*n^3-2*n^2)*x^3)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 1.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((2*n + (n^3 + n^2 - 10*n)*x + (n^4 - 4*n^3 + 3*n^2)*x^2)*P[n - 1, x] - (4*n*x^2 + (2*n^3 - 2*n^2)*x^3)*D[P[n - 1, x], x])/(2*n - 4 + (n^3 - 5*n^2 + 8*n - 4)*x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 1; for(n = 3, N, my(i = n + 1); v[i] = ((2*n + (n^3 + n^2 - 10*n)*x + (n^4 - 4*n^3 + 3*n^2)*x^2)*v[i - 1] - (4*n*x^2 + (2*n^3 - 2*n^2)*x^3)*deriv(v[i - 1], x))/(2*n - 4 + (n^3 - 5*n^2 + 8*n - 4)*x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, 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 of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the compl…?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the compl…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
-
from
Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
-
from
derivative of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).?
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
- [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.