A113413 → 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 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 1 | 1 | ||||||
| 2 | 4 | 4 | ||||||
| 3 | 8 | 1 | 9 | |||||
| 4 | 12 | 8 | 20 | |||||
| 5 | 16 | 32 | 1 | 49 | ||||
| 6 | 20 | 88 | 12 | 120 | ||||
| 7 | 24 | 192 | 72 | 1 | 289 | |||
| 8 | 28 | 360 | 292 | 16 | 696 | |||
| 9 | 32 | 608 | 912 | 128 | 1 | 1681 | ||
| 10 | 36 | 952 | 2364 | 688 | 20 | 4060 | ||
| 11 | 40 | 1408 | 5336 | 2816 | 200 | 1 | 9801 | |
| 12 | 44 | 1992 | 10836 | 9424 | 1340 | 24 | 23660 | |
| 13 | 48 | 2720 | 20256 | 27008 | 6800 | 288 | 1 | 57121 |
| 14 | 52 | 3608 | 35436 | 68464 | 28004 | 2312 | 28 | 137904 |
Generated b-files: A111587 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-c2a4f525057473eb· revision 1 · JSON- Definition source
derived:veronese_section_2_1- Fingerprint
f6-e984dc6c7f0d4aee
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 ?
- A111587: row sums, 14 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?
A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.
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: 4; 3: 8, 1; 4: 12, 8; 5: 16, 32, 1; 6: 20, 88, 12; 7: 24, 192, 72, 1; 8: 28, 360, 292, 16; 9: 32, 608, 912, 128, 1;
%F FormulaThe row polynomials satisfy P(n,x) = 2*P(n-1,x) - (1-x)*P(n-2,x) + 2*x*P(n-3,x) + x*P(n-4,x) for n >= 4, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 4, P(3,x) = 8 + x.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[2, x_] := 4;
P[3, x_] := 8 + x;
P[n_, x_] := P[n, x] = Expand[2*P[n - 1, x] - (1 - x)*P[n - 2, x] + 2*x*P[n - 3, x] + x*P[n - 4, 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] = 4; v[4] = 8 + x; for(n = 4, N, my(i = n + 1); v[i] = 2*v[i - 1] - (1 - x)*v[i - 2] + 2*x*v[i - 3] + x*v[i - 4]); 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-af7260029131ec6a -
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-af7260029131ec6a -
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-af7260029131ec6a -
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-af7260029131ec6a
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-af7260029131ec6aVeronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?
-
premise (sequence):
A Riordan array of coordination sequences.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang_derivative_lag
e-7fe1799d89540b32root: theorem checkLiu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?
-
-
premise (sequence):
A Riordan array of coordination sequences.
Related sequences ?
Same fingerprint (1)
Equal up to content, sign, reversal and a small index shift.
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