A038208 → Veronese 2 → D
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(-2\,n - 6\,n x + 2\,n^{2} + 2\,n^{2} x\right)\,P_{n-1}(x) + \left(4\,n x - 4\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 4\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 0 | |||||||
| 2 | 4 | 4 | ||||||
| 3 | 24 | 24 | ||||||
| 4 | 96 | 32 | 128 | |||||
| 5 | 320 | 320 | 640 | |||||
| 6 | 960 | 1920 | 192 | 3072 | ||||
| 7 | 2688 | 8960 | 2688 | 14336 | ||||
| 8 | 7168 | 35840 | 21504 | 1024 | 65536 | |||
| 9 | 18432 | 129024 | 129024 | 18432 | 294912 | |||
| 10 | 46080 | 430080 | 645120 | 184320 | 5120 | 1310720 | ||
| 11 | 112640 | 1351680 | 2838528 | 1351680 | 112640 | 5767168 | ||
| 12 | 270336 | 4055040 | 11354112 | 8110080 | 1351680 | 24576 | 25165824 | |
| 13 | 638976 | 11714560 | 42172416 | 42172416 | 11714560 | 638976 | 109051904 | |
| 14 | 1490944 | 32800768 | 147603456 | 196804608 | 82001920 | 8945664 | 114688 | 469762048 |
Compute more
?
Technical details
- Node id
n-ffa0709ca25ec776· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-937db0732045a112
Observed on the stored rows ?
- Degrees: -1, -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6 (half affine: slope 1, intercept -2)
- 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: 4; 3: 24; 4: 96, 32; 5: 320, 320; 6: 960, 1920, 192; 7: 2688, 8960, 2688; 8: 7168, 35840, 21504, 1024; 9: 18432, 129024, 129024, 18432;
%F FormulaThe row polynomials satisfy (n^2-3*n+2)*P(n,x) = (2*n^2-2*n+(2*n^2-6*n)*x)*P(n-1,x) + (4*n*x-4*n*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 4.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 4;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^2 - 2*n + (2*n^2 - 6*n)*x)*P[n - 1, x] + (4*n*x - 4*n*x^2)*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] = 0; v[3] = 4; for(n = 3, N, my(i = n + 1); v[i] = ((2*n^2 - 2*n + (2*n^2 - 6*n)*x)*v[i - 1] + (4*n*x - 4*n*x^2)*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 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_0 of Triangle whose (i,j)-th entry is binomial(i,j)*2^i.?
-
Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ? step ›
-
from
Triangle whose (i,j)-th entry is binomial(i,j)*2^i.?
-
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
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle whose (i,j)-th entry is binomial(i,j)*2^i.?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
-
Geometric basis map (elementary) 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?
-
from
Triangle whose (i,j)-th entry is binomial(i,j)*2^i.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle whose (i,j)-th entry is binomial(i,j)*2^i.?
-
-
from
veronese_section_2_0 of Triangle whose (i,j)-th entry is binomial(i,j)*2^i.?
Related ?
Same fingerprint ?
- A119900: Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0…
- A178821 → Veronese 2 (j=1)
- A159854 → Veronese 2 (j=1)
- A038208 → Veronese 2 (j=1)
- A034867: Triangle of odd-numbered terms in rows of Pascal's triangle.
- A109447: Binomial coefficients C(n,k) with n-k odd, read by rows.
- A178820 → Veronese 2 → D
- A007318 → Veronese 2 (j=1)
- A135838 → Veronese 2 (j=1)
- A034839 → D
- A003506 → Veronese 2 → D
- basis-map coefficients of A113214, shifted → Veronese 2 → D
- A228955 → D
- A003506 → Veronese 2 (j=1)
- A178820 → Veronese 2 (j=1)
- A028326 → Veronese 2 (j=1)
- A344565 → Veronese 2 (j=1)
- basis-map coefficients of A113214, shifted → Veronese 2 (j=1)
- A178822 → Veronese 2 (j=1)
- A178821 → Veronese 2 → D
- A178822 → Veronese 2 → D
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.