A120910 → Veronese 2 (j=1) → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-6 + 2\,n\right)\,P_{n}(x) = \left(-4\,x + 4\,n + n x\right)\,P_{n-1}(x) + \left(8\,x - 2\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 0\)
\(P_{3}(x) = 3\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | Pn(1) |
|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||
| 1 | 0 | ||||||
| 2 | 0 | ||||||
| 3 | 3 | 3 | |||||
| 4 | 24 | 24 | |||||
| 5 | 120 | 6 | 126 | ||||
| 6 | 480 | 72 | 552 | ||||
| 7 | 1680 | 504 | 9 | 2193 | |||
| 8 | 5376 | 2688 | 144 | 8208 | |||
| 9 | 16128 | 12096 | 1296 | 12 | 29532 | ||
| 10 | 46080 | 48384 | 8640 | 240 | 103344 | ||
| 11 | 126720 | 177408 | 47520 | 2640 | 15 | 354303 | |
| 12 | 337920 | 608256 | 228096 | 21120 | 360 | 1195752 | |
| 13 | 878592 | 1976832 | 988416 | 137280 | 4680 | 18 | 3985818 |
| 14 | 2236416 | 6150144 | 3953664 | 768768 | 43680 | 504 | 13153176 |
Compute more
?
Technical details
- Node id
n-f6177b47a1941021· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-4d2de010519ff778
Observed on the stored rows ?
- Degrees: -1, -1, -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5 (half affine: slope 1, intercept -3)
- 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: 0; 2: 0; 3: 3; 4: 24; 5: 120, 6; 6: 480, 72; 7: 1680, 504, 9; 8: 5376, 2688, 144; 9: 16128, 12096, 1296, 12;
%F FormulaThe row polynomials satisfy (2*n-6)*P(n,x) = (4*n+(n-4)*x)*P(n-1,x) + (8*x-2*x^2)*d/dx P(n-1,x) for n >= 4, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 0, P(3,x) = 3.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 0;
P[3, x_] := 3;
P[n_, x_] := P[n, x] = Expand[Together[((4*n + (n - 4)*x)*P[n - 1, x] + (8*x - 2*x^2)*D[P[n - 1, x], x])/(2*n - 6)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 0; v[4] = 3; for(n = 4, N, my(i = n + 1); v[i] = ((4*n + (n - 4)*x)*v[i - 1] + (8*x - 2*x^2)*deriv(v[i - 1], x))/(2*n - 6)); 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
veronese_section_2_1 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= …?
-
Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…?
-
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
Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…?
-
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) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…?
-
-
from
Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…?
-
-
from
veronese_section_2_1 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= …?
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.