A143495 → reverse → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 + 2\,n + n^{2}\right)\,P_{n}(x) = \left(-2 - 3\,n - 12\,n x + 16\,n x^{2} - n^{2} - 12\,n^{2} x + 41\,n^{2} x^{2} - 4\,n^{3} x + 34\,n^{3} x^{2} + 9\,n^{4} x^{2}\right)\,P_{n-2}(x) + \left(-x + 13\,x^{2} - 23\,x^{3} + 20\,n x^{2} - 52\,n x^{3} + 16\,n^{2} x^{2} - 31\,n^{2} x^{3} + 4\,n^{3} x^{2} + 2\,n^{3} x^{3} + 4\,n^{4} x^{3}\right)\,P_{n-2}'(x) + \left(x^{3} - 7\,x^{4} - 18\,n x^{4} - 15\,n^{2} x^{4} - 4\,n^{3} x^{4}\right)\,P_{n-2}''(x) + \left(3 + 4\,x + 5\,n + 12\,n x + 2\,n^{2} + 12\,n^{2} x + 4\,n^{3} x\right)\,P_{n-1}(x) + \left(x - 8\,x^{2} - 20\,n x^{2} - 16\,n^{2} x^{2} - 4\,n^{3} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 1 + 12\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 1 | 12 | 13 | ||||||
| 3 | 1 | 28 | 81 | 110 | |||||
| 4 | 1 | 48 | 333 | 432 | 814 | ||||
| 5 | 1 | 72 | 873 | 2800 | 2025 | 5771 | |||
| 6 | 1 | 100 | 1845 | 10560 | 19525 | 8748 | 40779 | ||
| 7 | 1 | 132 | 3420 | 30240 | 102025 | 121212 | 35721 | 292751 | |
| 8 | 1 | 168 | 5796 | 72800 | 385525 | 855792 | 695653 | 139968 | 2155703 |
Compute more
?
Technical details
- Node id
n-dba3a10a7cd587d6· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-119b729771ac2c5d
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: 1, 12; 3: 1, 28, 81; 4: 1, 48, 333, 432; 5: 1, 72, 873, 2800, 2025; 6: 1, 100, 1845, 10560, 19525, 8748; 7: 1, 132, 3420, 30240, 102025, 121212, 35721; 8: 1, 168, 5796, 72800, 385525, 855792, 695653, 139968; 9: 1, 208, 9198, 155232, 1181775, 4186728, 6519793, 3774400, 531441; 10: 1, 252, 13878, 302400, 3122175, 16099020, 40711405, 46352640, 19639341, 1968300;
%F FormulaThe row polynomials satisfy (n^2+2*n+1)*P(n,x) = -(n^2+3*n+2+(4*n^3+12*n^2+12*n)*x-(9*n^4+34*n^3+41*n^2+16*n)*x^2)*P(n-2,x) - (x-(4*n^3+16*n^2+20*n+13)*x^2-(4*n^4+2*n^3-31*n^2-52*n-23)*x^3)*d/dx P(n-2,x) + (x^3-(4*n^3+15*n^2+18*n+7)*x^4)*d^2/dx^2 P(n-2,x) + (2*n^2+5*n+3+(4*n^3+12*n^2+12*n+4)*x)*P(n-1,x) + (x-(4*n^3+16*n^2+20*n+8)*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + 12*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 1 + 12*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^2 + 3*n + 2 + (4*n^3 + 12*n^2 + 12*n)*x - (9*n^4 + 34*n^3 + 41*n^2 + 16*n)*x^2)*P[n - 2, x] - (x - (4*n^3 + 16*n^2 + 20*n + 13)*x^2 - (4*n^4 + 2*n^3 - 31*n^2 - 52*n - 23)*x^3)*D[P[n - 2, x], x] + (x^3 - (4*n^3 + 15*n^2 + 18*n + 7)*x^4)*D[P[n - 2, x], {x, 2}] + (2*n^2 + 5*n + 3 + (4*n^3 + 12*n^2 + 12*n + 4)*x)*P[n - 1, x] + (x - (4*n^3 + 16*n^2 + 20*n + 8)*x^2)*D[P[n - 1, x], x])/(n^2 + 2*n + 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 12*x; for(n = 3, N, my(i = n); v[i] = (-(n^2 + 3*n + 2 + (4*n^3 + 12*n^2 + 12*n)*x - (9*n^4 + 34*n^3 + 41*n^2 + 16*n)*x^2)*v[i - 2] - (x - (4*n^3 + 16*n^2 + 20*n + 13)*x^2 - (4*n^4 + 2*n^3 - 31*n^2 - 52*n - 23)*x^3)*deriv(v[i - 2], x) + (x^3 - (4*n^3 + 15*n^2 + 18*n + 7)*x^4)*deriv(deriv(v[i - 2], x), x) + (2*n^2 + 5*n + 3 + (4*n^3 + 12*n^2 + 12*n + 4)*x)*v[i - 1] + (x - (4*n^3 + 16*n^2 + 20*n + 8)*x^2)*deriv(v[i - 1], x))/(n^2 + 2*n + 1)); 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
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
reversal of Triangle read by rows: 3-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 3-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: 3-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 3-Stirling numbers of the second kind.?
- ↑ Liu–Wang theorem (above)
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Liu–Wang theorem (above)
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Liu–Wang theorem (above)
- ↑ Iterated real-rootedness preservers (above)
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
- ↑ Ray basis map theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
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
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
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
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
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
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Ray basis map theorem (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: 3-Stirling numbers of the second kind.?
-
-
from
reversal of Triangle read by rows: 3-Stirling numbers of the second kind.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: 3-Stirling numbers of the second kind.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: 3-Stirling numbers of the second kind.?
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
- [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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.