A089231 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 - x + n x + 3\,n^{2} x + n^{2} x^{2} + 2\,n^{3} x^{2} + n^{4} x^{2}\right)\,P_{n}(x) = \left(1 - x + 9\,n x - 3\,n x^{2} + n x^{3} + 3\,n^{2} x + 18\,n^{2} x^{2} + 5\,n^{2} x^{3} + 12\,n^{3} x^{2} + 14\,n^{3} x^{3} + n^{4} x^{2} + 10\,n^{4} x^{3} + 2\,n^{5} x^{3}\right)\,P_{n-1}(x) + \left(-x^{2} - x^{3} - x^{4} - 7\,n x^{3} - 5\,n x^{4} - 3\,n^{2} x^{3} - 10\,n^{2} x^{4} - 6\,n^{3} x^{4} - n^{4} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 1 | 8 | 9 | ||||||
| 2 | 1 | 24 | 54 | 79 | |||||
| 3 | 1 | 48 | 324 | 384 | 757 | ||||
| 4 | 1 | 80 | 1080 | 3840 | 3000 | 8001 | |||
| 5 | 1 | 120 | 2700 | 19200 | 45000 | 25920 | 92941 | ||
| 6 | 1 | 168 | 5670 | 67200 | 315000 | 544320 | 246960 | 1179319 | |
| 7 | 1 | 224 | 10584 | 188160 | 1470000 | 5080320 | 6914880 | 2580480 | 16244649 |
Compute more
?
Technical details
- Node id
n-66a70108663ff2e7· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-6f246b5e553e9e6e
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 0)
- 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: 1; 1: 1, 8; 2: 1, 24, 54; 3: 1, 48, 324, 384; 4: 1, 80, 1080, 3840, 3000; 5: 1, 120, 2700, 19200, 45000, 25920; 6: 1, 168, 5670, 67200, 315000, 544320, 246960; 7: 1, 224, 10584, 188160, 1470000, 5080320, 6914880, 2580480; 8: 1, 288, 18144, 451584, 5292000, 30481920, 82978560, 92897280, 29393280; 9: 1, 360, 29160, 967680, 15876000, 137168640, 622339200, 1393459200, 1322697600, 362880000;
%F FormulaThe row polynomials satisfy (1+(3*n^2+n-1)*x+(n^4+2*n^3+n^2)*x^2)*P(n,x) = (1+(3*n^2+9*n-1)*x+(n^4+12*n^3+18*n^2-3*n)*x^2+(2*n^5+10*n^4+14*n^3+5*n^2+n)*x^3)*P(n-1,x) - (x^2+(3*n^2+7*n+1)*x^3+(n^4+6*n^3+10*n^2+5*n+1)*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((1 + (3*n^2 + 9*n - 1)*x + (n^4 + 12*n^3 + 18*n^2 - 3*n)*x^2 + (2*n^5 + 10*n^4 + 14*n^3 + 5*n^2 + n)*x^3)*P[n - 1, x] - (x^2 + (3*n^2 + 7*n + 1)*x^3 + (n^4 + 6*n^3 + 10*n^2 + 5*n + 1)*x^4)*D[P[n - 1, x], x])/(1 + (3*n^2 + n - 1)*x + (n^4 + 2*n^3 + n^2)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((1 + (3*n^2 + 9*n - 1)*x + (n^4 + 12*n^3 + 18*n^2 - 3*n)*x^2 + (2*n^5 + 10*n^4 + 14*n^3 + 5*n^2 + n)*x^3)*v[i - 1] - (x^2 + (3*n^2 + 7*n + 1)*x^3 + (n^4 + 6*n^3 + 10*n^2 + 5*n + 1)*x^4)*deriv(v[i - 1], x))/(1 + (3*n^2 + n - 1)*x + (n^4 + 2*n^3 + n^2)*x^2)); 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
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangular array A066667 or A008297 unsigned and transposed.?
-
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
basis_map_A008277 of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+…?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Liu–Wang theorem (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A008277 of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 …?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.?
-
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
T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.?
-
-
from
basis_map_A008277 of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 …?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
-
from
basis_map_A008277 of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+…?
-
-
from
Triangular array A066667 or A008297 unsigned and transposed.?
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.