A124932 → reverse → basis A008277
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(8 + 19\,x + 9\,x^{2} + x^{3}\right)\,P_{n-3}(x) + \left(19\,x + 18\,x^{2} + 3\,x^{3}\right)\,P_{n-3}'(x) + \left(9\,x^{2} + 3\,x^{3}\right)\,P_{n-3}''(x) + \left(x^{3}\right)\,P_{n-3}'''(x) + \left(-12 - 15\,x - 3\,x^{2}\right)\,P_{n-2}(x) + \left(-15\,x - 6\,x^{2}\right)\,P_{n-2}'(x) + \left(-3\,x^{2}\right)\,P_{n-2}''(x) + \left(6 + 3\,x\right)\,P_{n-1}(x) + \left(3\,x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 5 + 2\,x\)
\(P_{2}(x) = 18 + 18\,x + 3\,x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 5 | 2 | 7 | |||||||||||||
| 2 | 18 | 18 | 3 | 39 | ||||||||||||
| 3 | 56 | 106 | 42 | 4 | 208 | |||||||||||
| 4 | 160 | 515 | 365 | 80 | 5 | 1125 | ||||||||||
| 5 | 432 | 2241 | 2535 | 960 | 135 | 6 | 6309 | |||||||||
| 6 | 1120 | 9086 | 15442 | 8995 | 2135 | 210 | 7 | 36995 | ||||||||
| 7 | 2816 | 35092 | 86380 | 72688 | 25900 | 4228 | 308 | 8 | 227420 | |||||||
| 8 | 6912 | 130869 | 455499 | 532602 | 267309 | 64386 | 7686 | 432 | 9 | 1465704 | ||||||
| 9 | 16640 | 475435 | 2301525 | 3642880 | 2474745 | 824880 | 143430 | 13080 | 585 | 10 | 9893210 | |||||
| 10 | 39424 | 1692680 | 11263736 | 23690645 | 21202115 | 9393384 | 2230767 | 293370 | 21120 | 770 | 11 | 69828022 | ||||
| 11 | 92160 | 5930838 | 53791914 | 148305432 | 171486810 | 98241330 | 30598722 | 5440644 | 560340 | 32670 | 990 | 12 | 514481862 | |||
| 12 | 212992 | 20513207 | 252010057 | 901434820 | 1327313273 | 963846312 | 382930834 | 88386870 | 12208911 | 1011725 | 48763 | 1248 | 13 | 3949919025 | ||
| 13 | 487424 | 70194229 | 1162687435 | 5353240984 | 9926067151 | 9000629638 | 4470173708 | 1302489188 | 231660429 | 25578553 | 1742741 | 70616 | 1547 | 14 | 31545023657 | |
| 14 | 1105920 | 238042530 | 5297885790 | 31204002375 | 72225473775 | 80835384630 | 49427172795 | 17814139200 | 3966924390 | 560269710 | 50585535 | 2884245 | 99645 | 1890 | 15 | 261623972445 |
Compute more
?
Technical details
- Node id
n-3404697af6c67a78· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-858fd07a4a9f264c
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: 5, 2; 2: 18, 18, 3; 3: 56, 106, 42, 4; 4: 160, 515, 365, 80, 5; 5: 432, 2241, 2535, 960, 135, 6; 6: 1120, 9086, 15442, 8995, 2135, 210, 7; 7: 2816, 35092, 86380, 72688, 25900, 4228, 308, 8; 8: 6912, 130869, 455499, 532602, 267309, 64386, 7686, 432, 9; 9: 16640, 475435, 2301525, 3642880, 2474745, 824880, 143430, 13080, 585, 10;
%F FormulaThe row polynomials satisfy P(n,x) = (8+19*x+9*x^2+x^3)*P(n-3,x) + (19*x+18*x^2+3*x^3)*d/dx P(n-3,x) + (9*x^2+3*x^3)*d^2/dx^2 P(n-3,x) + x^3*d^3/dx^3 P(n-3,x) - (12+15*x+3*x^2)*P(n-2,x) - (15*x+6*x^2)*d/dx P(n-2,x) - 3*x^2*d^2/dx^2 P(n-2,x) + (6+3*x)*P(n-1,x) + 3*x*d/dx P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 5 + 2*x, P(2,x) = 18 + 18*x + 3*x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 5 + 2*x;
P[2, x_] := 18 + 18*x + 3*x^2;
P[n_, x_] := P[n, x] = Expand[(8 + 19*x + 9*x^2 + x^3)*P[n - 3, x] + (19*x + 18*x^2 + 3*x^3)*D[P[n - 3, x], x] + (9*x^2 + 3*x^3)*D[P[n - 3, x], {x, 2}] + x^3*D[P[n - 3, x], {x, 3}] - (12 + 15*x + 3*x^2)*P[n - 2, x] - (15*x + 6*x^2)*D[P[n - 2, x], x] - 3*x^2*D[P[n - 2, x], {x, 2}] + (6 + 3*x)*P[n - 1, x] + 3*x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 5 + 2*x; v[3] = 18 + 18*x + 3*x^2; for(n = 3, N, my(i = n + 1); v[i] = (8 + 19*x + 9*x^2 + x^3)*v[i - 3] + (19*x + 18*x^2 + 3*x^3)*deriv(v[i - 3], x) + (9*x^2 + 3*x^3)*deriv(deriv(v[i - 3], x), x) + x^3*deriv(deriv(deriv(v[i - 3], x), x), x) - (12 + 15*x + 3*x^2)*v[i - 2] - (15*x + 6*x^2)*deriv(v[i - 2], x) - 3*x^2*deriv(deriv(v[i - 2], x), x) + (6 + 3*x)*v[i - 1] + 3*x*deriv(v[i - 1], 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 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
reversal of Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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?
-
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: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
-
-
from
reversal of Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
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.