A094638 → Veronese 2 (j=1)
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | Pn(1) |
|---|---|---|---|---|---|
| 0 | 0 | ||||
| 1 | 1 | 1 | |||
| 2 | 3 | 3 | |||
| 3 | 6 | 6 | 12 | ||
| 4 | 10 | 50 | 60 | ||
| 5 | 15 | 225 | 120 | 360 | |
| 6 | 21 | 735 | 1764 | 2520 | |
| 7 | 28 | 1960 | 13132 | 5040 | 20160 |
Computed in your browser ?
Technical details
- Node id
n-488cde5e29e3521f· revision 1 · JSON- Definition source
derived:veronese_section_2_1- Fingerprint
f6-fe5aabeaa01cd96d
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
OEIS matches ?
- A001710: row sums, 14 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A357711: row sums, 12 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A188588: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
OEIS submission text ?
Fields to paste into an OEIS submission: the example %e, the formula
%F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows.
For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched;
the matched terms were compared with the published ones, which identifies the node with the entry on a
finite prefix, not for every n. The PARI/GP program is not machine-checked here.
The atlas's own rows: n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 0; 1: 1; 2: 3; 3: 6, 6; 4: 10, 50; 5: 15, 225, 120; 6: 21, 735, 1764; 7: 28, 1960, 13132, 5040; 8: 36, 4536, 67284, 109584; 9: 45, 9450, 269325, 1172700, 362880;
%F FormulaThe row polynomials satisfy P(n,x) = 3*P(n-1,x) - (3-(n^2-n)*x)*P(n-2,x) + (1-(n^2-4*n+4)*x)*P(n-3,x) for n >= 3, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 3.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[2, x_] := 3;
P[n_, x_] := P[n, x] = Expand[3*P[n - 1, x] - (3 - (n^2 - n)*x)*P[n - 2, x] + (1 - (n^2 - 4*n + 4)*x)*P[n - 3, 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] = 3; for(n = 3, N, my(i = n + 1); v[i] = 3*v[i - 1] - (3 - (n^2 - n)*x)*v[i - 2] + (1 - (n^2 - 4*n + 4)*x)*v[i - 3]); 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)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-376476a04180fe2f -
Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
All coefficients of each polynomial have the same sign (after x -> -x when alternating).derived from the cited steps by a stated theorem:
e-376476a04180fe2f -
Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.derived from the cited steps by a stated theorem:
e-376476a04180fe2f -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-376476a04180fe2f
Proof chains
1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
veronese_section r=2, j=1, shift 0
e-376476a04180fe2fVeronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-419a6747cb084155root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-986a227a8a459030Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-5f21311bb67f8c1croot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A007318
e-0b3ba9047fae59edGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers root_domain
e-edbf92ee2e446027root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
-
parent_provers root_domain
e-2e5c10abc86c264droot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image reversal, shift 0
e-90e69a839bdbf74bAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-419a6747cb084155(expanded above) -
parent_provers paper_theorem
e-b29f35705824bef6root: theorem checkParent-row provers of polytool polytool ?
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…
-
preserver_image affine, shift 0
e-1ba7a8eebd893648Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
-
-
premise (sequence):
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…
-
↵ parent_provers paper_theorem
e-b29f35705824bef6(expanded above)
-
-
premise (sequence):
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…
Related sequences ?
No candidate equalities or related sequences.
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
- [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