A137597 → reverse → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-4\,x + n + 2\,n x\right)\,P_{n}(x) = \left(-1 + 4\,x + 3\,x^{2} - 14\,x^{3} - 6\,x^{4} + 12\,x^{5} - n - 2\,n x + 14\,n x^{2} + 22\,n x^{3} - 13\,n x^{4} - 22\,n x^{5} - 2\,n^{2} x - 6\,n^{2} x^{2} + 4\,n^{2} x^{3} + 20\,n^{2} x^{4} + 12\,n^{2} x^{5} - n^{3} x^{2} - 4\,n^{3} x^{3} - 5\,n^{3} x^{4} - 2\,n^{3} x^{5}\right)\,P_{n-2}(x) + \left(x^{2} - x^{3} - 4\,x^{4} + 2\,x^{5} + 4\,x^{6} + n x^{2} + 4\,n x^{3} - 9\,n x^{5} - 6\,n x^{6} + n^{2} x^{3} + 4\,n^{2} x^{4} + 5\,n^{2} x^{5} + 2\,n^{2} x^{6}\right)\,P_{n-2}'(x) + \left(1 - 6\,x + 2\,x^{2} + 20\,x^{3} + 2\,n + 4\,n x - 13\,n x^{2} - 18\,n x^{3} + 2\,n^{2} x + 6\,n^{2} x^{2} + 4\,n^{2} x^{3}\right)\,P_{n-1}(x) + \left(4\,x^{3} + 4\,x^{4} - n x^{2} - 3\,n x^{3} - 2\,n x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 2\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 2 | 2 | |||||||||||||
| 2 | 5 | 10 | 15 | ||||||||||||
| 3 | 9 | 44 | 45 | 98 | |||||||||||
| 4 | 14 | 122 | 297 | 208 | 641 | ||||||||||
| 5 | 20 | 270 | 1155 | 1884 | 1015 | 4344 | |||||||||
| 6 | 27 | 520 | 3420 | 9664 | 11930 | 5262 | 30823 | ||||||||
| 7 | 35 | 910 | 8505 | 36624 | 77350 | 77202 | 28980 | 229606 | |||||||
| 8 | 44 | 1484 | 18690 | 113764 | 362950 | 613290 | 515767 | 169176 | 1795165 | ||||||
| 9 | 54 | 2292 | 37422 | 306012 | 1371930 | 3473574 | 4902177 | 3572960 | 1043775 | 14710196 | |||||
| 10 | 65 | 3390 | 69660 | 737268 | 4423755 | 15646560 | 32847500 | 39877208 | 25708113 | 6785700 | 126099219 | ||||
| 11 | 77 | 4840 | 122265 | 1627428 | 12609135 | 59441514 | 173339705 | 311025528 | 331853049 | 192172430 | 46349567 | 1128545538 | |||
| 12 | 90 | 6710 | 204435 | 3344748 | 32547900 | 197577204 | 764695470 | 1895917408 | 2972832984 | 2833420600 | 1491714928 | 331733244 | 10523995721 | ||
| 13 | 104 | 9074 | 328185 | 6477328 | 77423775 | 589231500 | 2927718794 | 9594098800 | 20686174938 | 28828746440 | 24859153176 | 12013918812 | 2481691186 | 102064972112 | |
| 14 | 119 | 12012 | 508872 | 11927916 | 171956785 | 1605760728 | 9981795824 | 41861307488 | 118824962256 | 226699696860 | 284549669404 | 224273710764 | 100284925741 | 19361419630 | 1027627654399 |
Compute more
?
Technical details
- Node id
n-804e73f8eff5532b· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-7154b6557c922402
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: 2; 2: 5, 10; 3: 9, 44, 45; 4: 14, 122, 297, 208; 5: 20, 270, 1155, 1884, 1015; 6: 27, 520, 3420, 9664, 11930, 5262; 7: 35, 910, 8505, 36624, 77350, 77202, 28980; 8: 44, 1484, 18690, 113764, 362950, 613290, 515767, 169176; 9: 54, 2292, 37422, 306012, 1371930, 3473574, 4902177, 3572960, 1043775;
%F FormulaThe row polynomials satisfy (n+(2*n-4)*x)*P(n,x) = -(n+1+(2*n^2+2*n-4)*x+(n^3+6*n^2-14*n-3)*x^2+(4*n^3-4*n^2-22*n+14)*x^3+(5*n^3-20*n^2+13*n+6)*x^4+(2*n^3-12*n^2+22*n-12)*x^5)*P(n-2,x) + ((n+1)*x^2+(n^2+4*n-1)*x^3+(4*n^2-4)*x^4+(5*n^2-9*n+2)*x^5+(2*n^2-6*n+4)*x^6)*d/dx P(n-2,x) + (2*n+1+(2*n^2+4*n-6)*x+(6*n^2-13*n+2)*x^2+(4*n^2-18*n+20)*x^3)*P(n-1,x) - (n*x^2+(3*n-4)*x^3+(2*n-4)*x^4)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 2.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[(-(n + 1 + (2*n^2 + 2*n - 4)*x + (n^3 + 6*n^2 - 14*n - 3)*x^2 + (4*n^3 - 4*n^2 - 22*n + 14)*x^3 + (5*n^3 - 20*n^2 + 13*n + 6)*x^4 + (2*n^3 - 12*n^2 + 22*n - 12)*x^5)*P[n - 2, x] + ((n + 1)*x^2 + (n^2 + 4*n - 1)*x^3 + (4*n^2 - 4)*x^4 + (5*n^2 - 9*n + 2)*x^5 + (2*n^2 - 6*n + 4)*x^6)*D[P[n - 2, x], x] + (2*n + 1 + (2*n^2 + 4*n - 6)*x + (6*n^2 - 13*n + 2)*x^2 + (4*n^2 - 18*n + 20)*x^3)*P[n - 1, x] - (n*x^2 + (3*n - 4)*x^3 + (2*n - 4)*x^4)*D[P[n - 1, x], x])/(n + (2*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] = 2; for(n = 2, N, my(i = n + 1); v[i] = (-(n + 1 + (2*n^2 + 2*n - 4)*x + (n^3 + 6*n^2 - 14*n - 3)*x^2 + (4*n^3 - 4*n^2 - 22*n + 14)*x^3 + (5*n^3 - 20*n^2 + 13*n + 6)*x^4 + (2*n^3 - 12*n^2 + 22*n - 12)*x^5)*v[i - 2] + ((n + 1)*x^2 + (n^2 + 4*n - 1)*x^3 + (4*n^2 - 4)*x^4 + (5*n^2 - 9*n + 2)*x^5 + (2*n^2 - 6*n + 4)*x^6)*deriv(v[i - 2], x) + (2*n + 1 + (2*n^2 + 4*n - 6)*x + (6*n^2 - 13*n + 2)*x^2 + (4*n^2 - 18*n + 20)*x^3)*v[i - 1] - (n*x^2 + (3*n - 4)*x^3 + (2*n - 4)*x^4)*deriv(v[i - 1], x))/(n + (2*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 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
reversal of Triangle read by rows: A008277 * A007318.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: A008277 * A007318.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? 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)
-
Geometric basis map (elementary) polytool ? step ›
-
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?
-
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) 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.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A008277 of a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
-
from
basis_map_A008277 of a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: A008277 * A007318.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: A008277 * A007318.?
- ↑ Ray basis map theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have …?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the …?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the …?
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have …?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: A008277 * A007318.?
-
-
from
reversal of Triangle read by rows: A008277 * A007318.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on differential operators (above)
-
-
from
Triangle read by rows: A008277 * A007318.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: A008277 * A007318.?
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
- [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.