A178820 → Veronese 2 (j=1) → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(2\,n - 2\,n^{2} + n^{2} x - 2\,n^{3} x + n^{4} x\right)\,P_{n}(x) = \left(24\,x - 6\,n - 4\,n x - 6\,n x^{2} - 2\,n^{2} - 7\,n^{2} x - 5\,n^{2} x^{2} + 2\,n^{3} x + 2\,n^{3} x^{2} + n^{4} x + n^{4} x^{2}\right)\,P_{n-1}(x) + \left(-12\,x + 12\,x^{2} - 4\,n x + 10\,n x^{2} - 6\,n x^{3} + 8\,n^{2} x^{2} - 8\,n^{2} x^{3} + 2\,n^{3} x^{2} - 2\,n^{3} x^{3}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 4\)
Rows ?
| n | x0 | x1 | x2 | x3 | Pn(1) |
|---|---|---|---|---|---|
| 0 | 0 | ||||
| 1 | 4 | 4 | |||
| 2 | 20 | 20 | |||
| 3 | 60 | 40 | 100 | ||
| 4 | 140 | 280 | 420 | ||
| 5 | 280 | 1120 | 168 | 1568 | |
| 6 | 504 | 3360 | 1512 | 5376 | |
| 7 | 840 | 8400 | 7560 | 480 | 17280 |
Compute more
?
Technical details
- Node id
n-8e043fdc31547ace· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-49176c5aecdbb25b
Observed on the stored rows ?
- Degrees: -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6 (half 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: 4; 2: 20; 3: 60, 40; 4: 140, 280; 5: 280, 1120, 168; 6: 504, 3360, 1512; 7: 840, 8400, 7560, 480; 8: 1320, 18480, 27720, 5280; 9: 1980, 36960, 83160, 31680, 1100;
%F FormulaThe row polynomials satisfy -(2*n^2-2*n-(n^4-2*n^3+n^2)*x)*P(n,x) = -(2*n^2+6*n-(n^4+2*n^3-7*n^2-4*n+24)*x-(n^4+2*n^3-5*n^2-6*n)*x^2)*P(n-1,x) - ((4*n+12)*x-(2*n^3+8*n^2+10*n+12)*x^2+(2*n^3+8*n^2+6*n)*x^3)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 4.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 4;
P[n_, x_] := P[n, x] = Expand[Together[(-(2*n^2 + 6*n - (n^4 + 2*n^3 - 7*n^2 - 4*n + 24)*x - (n^4 + 2*n^3 - 5*n^2 - 6*n)*x^2)*P[n - 1, x] - ((4*n + 12)*x - (2*n^3 + 8*n^2 + 10*n + 12)*x^2 + (2*n^3 + 8*n^2 + 6*n)*x^3)*D[P[n - 1, x], x])/(-2*n^2 + 2*n + (n^4 - 2*n^3 + n^2)*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] = 4; for(n = 2, N, my(i = n + 1); v[i] = (-(2*n^2 + 6*n - (n^4 + 2*n^3 - 7*n^2 - 4*n + 24)*x - (n^4 + 2*n^3 - 5*n^2 - 6*n)*x^2)*v[i - 1] - ((4*n + 12)*x - (2*n^3 + 8*n^2 + 10*n + 12)*x^2 + (2*n^3 + 8*n^2 + 6*n)*x^3)*deriv(v[i - 1], x))/(-2*n^2 + 2*n + (n^4 - 2*n^3 + n^2)*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 multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
veronese_section_2_1 of Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
-
Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
-
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 ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
-
-
from
veronese_section_2_1 of Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
Related ?
Same fingerprint ?
- A034867 → θ+1
- A038208 → Veronese 2 (j=1) → θ+1
- basis-map coefficients of A113214, shifted → Veronese 2 (j=1) → θ+1
- A103406 → Veronese 2 (j=1)
- A178821 → Veronese 2 (j=1) → θ+1
- A159854 → Veronese 2 (j=1) → D
- A178822 → Veronese 2 (j=1) → θ+1
- A003506 → Veronese 2 (j=1) → θ+1
- A028326 → Veronese 2 (j=1) → θ+1
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.