A125092 → reverse → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-1 - 4\,x - 6\,x^{2} - 4\,x^{3} - x^{4}\right)\,P_{n-4}(x) + \left(4 + 12\,x + 12\,x^{2} + 4\,x^{3}\right)\,P_{n-3}(x) + \left(-6 - 12\,x - 6\,x^{2}\right)\,P_{n-2}(x) + \left(4 + 4\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 8 + 2\,x\)
\(P_{3}(x) = 27 + 24\,x + 3\,x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 1 | 1 | ||||||
| 2 | 8 | 2 | 10 | |||||
| 3 | 27 | 24 | 3 | 54 | ||||
| 4 | 64 | 108 | 48 | 4 | 224 | |||
| 5 | 125 | 320 | 270 | 80 | 5 | 800 | ||
| 6 | 216 | 750 | 960 | 540 | 120 | 6 | 2592 | |
| 7 | 343 | 1512 | 2625 | 2240 | 945 | 168 | 7 | 7840 |
Compute more
?
Technical details
- Node id
n-daef2e79c4033d27· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-d42e6339eab21b9c
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: 8, 2; 3: 27, 24, 3; 4: 64, 108, 48, 4; 5: 125, 320, 270, 80, 5; 6: 216, 750, 960, 540, 120, 6; 7: 343, 1512, 2625, 2240, 945, 168, 7; 8: 512, 2744, 6048, 7000, 4480, 1512, 224, 8; 9: 729, 4608, 12348, 18144, 15750, 8064, 2268, 288, 9;
%F FormulaThe row polynomials satisfy P(n,x) = -(1+4*x+6*x^2+4*x^3+x^4)*P(n-4,x) + (4+12*x+12*x^2+4*x^3)*P(n-3,x) - (6+12*x+6*x^2)*P(n-2,x) + (4+4*x)*P(n-1,x) for n >= 4, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 8 + 2*x, P(3,x) = 27 + 24*x + 3*x^2.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[2, x_] := 8 + 2*x;
P[3, x_] := 27 + 24*x + 3*x^2;
P[n_, x_] := P[n, x] = Expand[-(1 + 4*x + 6*x^2 + 4*x^3 + x^4)*P[n - 4, x] + (4 + 12*x + 12*x^2 + 4*x^3)*P[n - 3, x] - (6 + 12*x + 6*x^2)*P[n - 2, x] + (4 + 4*x)*P[n - 1, 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] = 1; v[3] = 8 + 2*x; v[4] = 27 + 24*x + 3*x^2; for(n = 4, N, my(i = n + 1); v[i] = -(1 + 4*x + 6*x^2 + 4*x^3 + x^4)*v[i - 4] + (4 + 12*x + 12*x^2 + 4*x^3)*v[i - 3] - (6 + 12*x + 6*x^2)*v[i - 2] + (4 + 4*x)*v[i - 1]); 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
reversal of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= 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?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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 [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?
-
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)
-
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 (above)
-
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 [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 (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 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…?
-
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?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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) (above)
- ↑ 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…?
-
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+1)^2*binomial(n,k) (0 <= k <= n).?
-
-
from
reversal of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
Related ?
Same fingerprint ?
- A196347 → (θ+1)²
- A038221 → (θ+1)²
- A134346 → (θ+1)²
- A038325 → basis A013609 → (θ+1)²
- A038330 → basis A013611 → (θ+1)²
- A135065 → (θ+1)²
- A178822 → (θ+1)²
- A178821 → (θ+1)²
- A085881 → basis A013609 → (θ+1)²
- A125092: Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).
- A196347 → basis A013609 → (θ+1)²
- A028326 → D → (θ+1)²
- A178820 → basis A013609 → (θ+1)²
- A178821 → basis A013609 → (θ+1)²
- basis-map coefficients of A113214, shifted → (θ+1)²
- basis-map coefficients of A127647 → (θ+1)²
- A085880 → (θ+1)²
- A038221 → basis A013609 → (θ+1)²
- A085881 → (θ+1)²
- A038338 → (θ+1)²
- A156992 → (θ+1)²
- A003506 → (θ+1)²
- basis-map coefficients of A113214, shifted → D → (θ+1)²
- A131431 → x ↦ x+1 → (θ+1)²
- basis-map coefficients of A113214, shifted → basis A013609 → (θ+1)²
- A178822 → basis A013609 → (θ+1)²
- A003506 → D → (θ+1)²
- A038325 → (θ+1)²
- A028326 → basis A013609 → (θ+1)²
- A125092 → reverse
- A344565 → (θ+1)²
- A124860 → (θ+1)²
- A356546 → (θ+1)²
- A135838 → (θ+1)²
- A038208 → D → (θ+1)²
- basis-map coefficients of A026729, shifted → basis A007318 → (θ+1)²
- basis-map coefficients of A026729 → basis A007318 → (θ+1)²
- basis-map coefficients of A112227 → x ↦ x+1 → (θ+1)²
- A356546 → basis A013609 → (θ+1)²
- A027465 → basis A013611 → (θ+1)²
- A085880 → basis A013609 → (θ+1)²
- A038208 → (θ+1)²
- A156992 → basis A013609 → (θ+1)²
- A038338 → basis A013609 → (θ+1)²
- A376827 → (θ+1)²
- A085880 → D → (θ+1)²
- A178820 → (θ+1)²
- A120910 → basis A013610 → (θ+1)²
- A028326 → (θ+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.