A093375 → D → basis A008277
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(2 - 3\,n + n^{2}\right)\,P_{n}(x) = \left(4\,n + 5\,n x + n x^{2} - 4\,n^{2} - 5\,n^{2} x - n^{2} x^{2}\right)\,P_{n-2}(x) + \left(5\,n x + 2\,n x^{2} - 5\,n^{2} x - 2\,n^{2} x^{2}\right)\,P_{n-2}'(x) + \left(n x^{2} - n^{2} x^{2}\right)\,P_{n-2}''(x) + \left(-8\,n - 4\,n x + 4\,n^{2} + 2\,n^{2} x\right)\,P_{n-1}(x) + \left(-4\,n x + 2\,n^{2} x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 6 + 2\,x\)
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 | 2 | 8 | ||||||||||||
| 3 | 24 | 21 | 3 | 48 | |||||||||||
| 4 | 80 | 136 | 48 | 4 | 268 | ||||||||||
| 5 | 240 | 705 | 455 | 90 | 5 | 1495 | |||||||||
| 6 | 672 | 3216 | 3360 | 1170 | 150 | 6 | 8574 | ||||||||
| 7 | 1792 | 13517 | 21427 | 11620 | 2555 | 231 | 7 | 51149 | |||||||
| 8 | 4608 | 53712 | 124208 | 98168 | 32760 | 4984 | 336 | 8 | 318784 | ||||||
| 9 | 11520 | 204993 | 673983 | 745038 | 352989 | 80010 | 8946 | 468 | 9 | 2077956 | |||||
| 10 | 28160 | 759160 | 3486600 | 5243710 | 3382890 | 1068690 | 175560 | 15060 | 630 | 10 | 14160470 | ||||
| 11 | 67584 | 2747085 | 17404211 | 34921920 | 29818415 | 12589269 | 2842917 | 354420 | 24090 | 825 | 11 | 100770747 | |||
| 12 | 159744 | 9760488 | 84531480 | 223061652 | 247001700 | 135426324 | 40310424 | 6834564 | 669240 | 36960 | 1056 | 12 | 747793644 | ||
| 13 | 372736 | 34170929 | 401850319 | 1379504698 | 1951130753 | 1360712496 | 518696464 | 114690576 | 15143271 | 1196195 | 54769 | 1326 | 13 | 5777524545 | |
| 14 | 860160 | 118182624 | 1877876000 | 8316795578 | 14850537702 | 12969490534 | 6200330136 | 1737071336 | 296582286 | 31369338 | 2042040 | 78806 | 1638 | 14 | 46401218192 |
Compute more
?
Technical details
- Node id
n-305a77f88a896b44· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-5fb88e06d449edae
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, 2; 3: 24, 21, 3; 4: 80, 136, 48, 4; 5: 240, 705, 455, 90, 5; 6: 672, 3216, 3360, 1170, 150, 6; 7: 1792, 13517, 21427, 11620, 2555, 231, 7; 8: 4608, 53712, 124208, 98168, 32760, 4984, 336, 8; 9: 11520, 204993, 673983, 745038, 352989, 80010, 8946, 468, 9;
%F FormulaThe row polynomials satisfy (n^2-3*n+2)*P(n,x) = -(4*n^2-4*n+(5*n^2-5*n)*x+(n^2-n)*x^2)*P(n-2,x) - ((5*n^2-5*n)*x+(2*n^2-2*n)*x^2)*d/dx P(n-2,x) - (n^2-n)*x^2*d^2/dx^2 P(n-2,x) + (4*n^2-8*n+(2*n^2-4*n)*x)*P(n-1,x) + (2*n^2-4*n)*x*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 6 + 2*x.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[2, x_] := 6 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(4*n^2 - 4*n + (5*n^2 - 5*n)*x + (n^2 - n)*x^2)*P[n - 2, x] - ((5*n^2 - 5*n)*x + (2*n^2 - 2*n)*x^2)*D[P[n - 2, x], x] - (n^2 - n)*x^2*D[P[n - 2, x], {x, 2}] + (4*n^2 - 8*n + (2*n^2 - 4*n)*x)*P[n - 1, x] + (2*n^2 - 4*n)*x*D[P[n - 1, x], x])/(n^2 - 3*n + 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; v[3] = 6 + 2*x; for(n = 3, N, my(i = n + 1); v[i] = (-(4*n^2 - 4*n + (5*n^2 - 5*n)*x + (n^2 - n)*x^2)*v[i - 2] - ((5*n^2 - 5*n)*x + (2*n^2 - 2*n)*x^2)*deriv(v[i - 2], x) - (n^2 - n)*x^2*deriv(deriv(v[i - 2], x), x) + (4*n^2 - 8*n + (2*n^2 - 4*n)*x)*v[i - 1] + (2*n^2 - 4*n)*x*deriv(v[i - 1], x))/(n^2 - 3*n + 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 Ray basis map theorem
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Ray basis map theorem
Proof chains ? JSON
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
one_plus_derivative of Exponential Riordan array [x*exp(x),x].?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
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)
-
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 read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on differential operators (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on differential operators (above)
-
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?
-
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
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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?
-
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: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Exponential Riordan array [x*exp(x),x].?
-
Geometric basis map (elementary) polytool ? step ›
-
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?
-
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 differential operators [SP14] polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
one_plus_derivative 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
- [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.