A216973 → θ+1 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(3 - 2\,x + x^{2} - 5\,n + 4\,n x - 2\,n x^{2} + 2\,n^{2} - 3\,n^{2} x + n^{2} x^{2} + n^{3} x\right)\,P_{n}(x) = \left(-n + n x^{2} + 2\,n^{2} + 2\,n^{2} x + n^{2} x^{2} + n^{2} x^{3} + n^{3} x + n^{3} x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 1 | 1 | |||||||||||||
| 2 | 6 | 4 | 10 | ||||||||||||
| 3 | 15 | 30 | 9 | 54 | |||||||||||
| 4 | 28 | 96 | 84 | 16 | 224 | ||||||||||
| 5 | 45 | 220 | 330 | 180 | 25 | 800 | |||||||||
| 6 | 66 | 420 | 900 | 840 | 330 | 36 | 2592 | ||||||||
| 7 | 91 | 714 | 1995 | 2660 | 1785 | 546 | 49 | 7840 | |||||||
| 8 | 120 | 1120 | 3864 | 6720 | 6440 | 3360 | 840 | 64 | 22528 | ||||||
| 9 | 153 | 1656 | 6804 | 14616 | 18270 | 13608 | 5796 | 1224 | 81 | 62208 | |||||
| 10 | 190 | 2340 | 11160 | 28560 | 44100 | 42840 | 26040 | 9360 | 1710 | 100 | 166400 | ||||
| 11 | 231 | 3190 | 17325 | 51480 | 94710 | 113652 | 90090 | 46200 | 14355 | 2310 | 121 | 433664 | |||
| 12 | 276 | 4224 | 25740 | 87120 | 186120 | 266112 | 260568 | 174240 | 77220 | 21120 | 3036 | 144 | 1105920 | ||
| 13 | 325 | 5460 | 36894 | 140140 | 341055 | 566280 | 660660 | 545688 | 315315 | 122980 | 30030 | 3900 | 169 | 2768896 | |
| 14 | 378 | 6916 | 51324 | 216216 | 590590 | 1117116 | 1513512 | 1489488 | 1063062 | 540540 | 188188 | 41496 | 4914 | 196 | 6823936 |
Compute more
?
Technical details
- Node id
n-2cbd808c0ff0a0d6· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-0bc6c5656007bb44
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 -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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 0; 1: 1; 2: 6, 4; 3: 15, 30, 9; 4: 28, 96, 84, 16; 5: 45, 220, 330, 180, 25; 6: 66, 420, 900, 840, 330, 36; 7: 91, 714, 1995, 2660, 1785, 546, 49; 8: 120, 1120, 3864, 6720, 6440, 3360, 840, 64; 9: 153, 1656, 6804, 14616, 18270, 13608, 5796, 1224, 81;
%F FormulaThe row polynomials satisfy (2*n^2-5*n+3+(n^3-3*n^2+4*n-2)*x+(n^2-2*n+1)*x^2)*P(n,x) = (2*n^2-n+(n^3+2*n^2)*x+(n^3+n^2+n)*x^2+n^2*x^3)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 1.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^2 - n + (n^3 + 2*n^2)*x + (n^3 + n^2 + n)*x^2 + n^2*x^3)*P[n - 1, x])/(2*n^2 - 5*n + 3 + (n^3 - 3*n^2 + 4*n - 2)*x + (n^2 - 2*n + 1)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((2*n^2 - n + (n^3 + 2*n^2)*x + (n^3 + n^2 + n)*x^2 + n^2*x^3)*v[i - 1])/(2*n^2 - 5*n + 3 + (n^3 - 3*n^2 + 4*n - 2)*x + (n^2 - 2*n + 1)*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 differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, 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
theta_plus_one of Exponential Riordan array [x*exp(x),x].?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Exponential Riordan array [x*exp(x),x].?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Infinitesimal Pascal matrix: generator (lower triangular matrix representation) of the Pascal matrix, the classical ope…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
-
from
Infinitesimal Pascal matrix: generator (lower triangular matrix representation) of the Pascal matrix, the classical ope…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
binomial?
-
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
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1-x,x/(1-x)).?
-
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
Riordan array (1-x,x/(1-x)).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
binomial?
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
-
from
Exponential Riordan array [x*exp(x),x].?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
-
from
theta_plus_one of Exponential Riordan array [x*exp(x),x].?
Related ?
Same fingerprint ?
References
- [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
- [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
- [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
- [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
- [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.