A102537 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(4\,n + 4\,n x - 2\,n x^{2} + 10\,n^{2} x - 4\,n^{2} x^{2} - 12\,n^{3} + 4\,n^{3} x + 8\,n^{4}\right)\,P_{n}(x) = \left(4\,n x - 8\,n x^{2} + 6\,n x^{3} + 16\,n^{2} x + 8\,n^{2} x^{2} - 18\,n^{2} x^{3} + 4\,n^{3} - 26\,n^{3} x + 18\,n^{3} x^{2} + 8\,n^{4} + 36\,n^{4} x\right)\,P_{n-1}(x) + \left(-2\,x - 2\,x^{2} + 2\,x^{3} + 3\,x^{4} + 10\,n x + 12\,n x^{2} - 11\,n x^{3} - 9\,n x^{4} - 18\,n^{2} x - 16\,n^{2} x^{2} + 9\,n^{2} x^{3} + 16\,n^{3} x + 18\,n^{3} 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 | 4 | 3 | 7 | ||||||
| 3 | 9 | 32 | 12 | 53 | |||||
| 4 | 16 | 125 | 220 | 55 | 416 | ||||
| 5 | 25 | 336 | 1248 | 1456 | 273 | 3338 | |||
| 6 | 36 | 735 | 4550 | 10920 | 9520 | 1428 | 27189 | ||
| 7 | 49 | 1408 | 12920 | 50592 | 89148 | 62016 | 7752 | 223885 | |
| 8 | 64 | 2457 | 31122 | 177555 | 502740 | 697851 | 403788 | 43263 | 1858840 |
Compute more
?
Technical details
- Node id
n-69c049f5da53d5d7· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-a919b4b97d298de5
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: 4, 3; 3: 9, 32, 12; 4: 16, 125, 220, 55; 5: 25, 336, 1248, 1456, 273; 6: 36, 735, 4550, 10920, 9520, 1428; 7: 49, 1408, 12920, 50592, 89148, 62016, 7752; 8: 64, 2457, 31122, 177555, 502740, 697851, 403788, 43263; 9: 81, 4000, 66640, 517440, 2107490, 4647104, 5313000, 2631200, 246675; 10: 100, 6171, 130548, 1317624, 7225680, 22694100, 40849380, 39665340, 17168580, 1430715;
%F FormulaThe row polynomials satisfy (8*n^4-12*n^3+4*n+(4*n^3+10*n^2+4*n)*x-(4*n^2+2*n)*x^2)*P(n,x) = (8*n^4+4*n^3+(36*n^4-26*n^3+16*n^2+4*n)*x+(18*n^3+8*n^2-8*n)*x^2-(18*n^2-6*n)*x^3)*P(n-1,x) + ((16*n^3-18*n^2+10*n-2)*x+(18*n^3-16*n^2+12*n-2)*x^2+(9*n^2-11*n+2)*x^3-(9*n-3)*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[((8*n^4 + 4*n^3 + (36*n^4 - 26*n^3 + 16*n^2 + 4*n)*x + (18*n^3 + 8*n^2 - 8*n)*x^2 - (18*n^2 - 6*n)*x^3)*P[n - 1, x] + ((16*n^3 - 18*n^2 + 10*n - 2)*x + (18*n^3 - 16*n^2 + 12*n - 2)*x^2 + (9*n^2 - 11*n + 2)*x^3 - (9*n - 3)*x^4)*D[P[n - 1, x], x])/(8*n^4 - 12*n^3 + 4*n + (4*n^3 + 10*n^2 + 4*n)*x - (4*n^2 + 2*n)*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] = ((8*n^4 + 4*n^3 + (36*n^4 - 26*n^3 + 16*n^2 + 4*n)*x + (18*n^3 + 8*n^2 - 8*n)*x^2 - (18*n^2 - 6*n)*x^3)*v[i - 1] + ((16*n^3 - 18*n^2 + 10*n - 2)*x + (18*n^3 - 16*n^2 + 12*n - 2)*x^2 + (9*n^2 - 11*n + 2)*x^3 - (9*n - 3)*x^4)*deriv(v[i - 1], x))/(8*n^4 - 12*n^3 + 4*n + (4*n^3 + 10*n^2 + 4*n)*x - (4*n^2 + 2*n)*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
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.