type_b_eulerian → γ
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 1 | 1 | |||||||
| 2 | 1 | 4 | 5 | ||||||
| 3 | 1 | 20 | 21 | ||||||
| 4 | 1 | 72 | 80 | 153 | |||||
| 5 | 1 | 232 | 976 | 1209 | |||||
| 6 | 1 | 716 | 7664 | 3904 | 12285 | ||||
| 7 | 1 | 2172 | 49776 | 88640 | 140589 | ||||
| 8 | 1 | 6544 | 292320 | 1217792 | 354560 | 1871217 | |||
| 9 | 1 | 19664 | 1618656 | 13201664 | 12933376 | 27773361 | |||
| 10 | 1 | 59028 | 8643872 | 124784768 | 274820352 | 51733504 | 460041525 | ||
| 11 | 1 | 177124 | 45108256 | 1080946304 | 4469939456 | 2767631360 | 8363802501 | ||
| 12 | 1 | 531416 | 231917744 | 8829655296 | 61848381184 | 84083218432 | 11070525440 | 166064229513 | |
| 13 | 1 | 1594296 | 1180845360 | 69228954880 | 768547157760 | 1914489501696 | 816582578176 | 3570030632169 | |
| 14 | 1 | 4782940 | 5974375824 | 527113117120 | 8855335156480 | 36430327673856 | 33589447536640 | 3266330312704 | 82674532955565 |
Generated b-files: A182825 (row sums), A333273 ?
Computed in your browser ?
Technical details
- Node id
n-7b489708d21ffcfe· revision 1 · JSON- Definition source
derived:gamma_polynomial- Fingerprint
f6-f394a67368746b91
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half affine: slope 1, intercept 0)
- 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 ?
- A333273: triangle, 41 terms agree, 11 full rows row lengths from the atlas (tabf) OEIS nonn · view at the OEIS · generated b-file 991 terms from n = 1 ?
- A182825: row sums, 15 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: 1; 1: 1; 2: 1, 4; 3: 1, 20; 4: 1, 72, 80; 5: 1, 232, 976; 6: 1, 716, 7664, 3904; 7: 1, 2172, 49776, 88640; 8: 1, 6544, 292320, 1217792, 354560; 9: 1, 19664, 1618656, 13201664, 12933376;
%F FormulaThe row polynomials satisfy P(n,x) = (1+(4*n-4)*x)*P(n-1,x) + (2*x-8*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + (4*n - 4)*x)*P[n - 1, x] + (2*x - 8*x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (1 + (4*n - 4)*x)*v[i - 1] + (2*x - 8*x^2)*deriv(v[i - 1], 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)Generated with polytool c48629374597.
A333273: triangle, offset 1, from the row P1
%e ExampleTriangle begins: 1: 1; 2: 1, 4; 3: 1, 20; 4: 1, 72, 80; 5: 1, 232, 976; 6: 1, 716, 7664, 3904; 7: 1, 2172, 49776, 88640; 8: 1, 6544, 292320, 1217792, 354560; 9: 1, 19664, 1618656, 13201664, 12933376; 10: 1, 59028, 8643872, 124784768, 274820352, 51733504;
%F FormulaThe row polynomials satisfy P(n,x) = (1+(4*n-4)*x)*P(n-1,x) + (2*x-8*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + (4*n - 4)*x)*P[n - 1, x] + (2*x - 8*x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + (4*n - 4)*x)*v[i - 1] + (2*x - 8*x^2)*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)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-fcc9671b64420c56 -
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-fcc9671b64420c56 -
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-fcc9671b64420c56
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
-
gamma_polynomial scale 1, shift 0
e-fcc9671b64420c56Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
type_b_eulerian
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-4675d8b985e3f46aroot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
-
premise (sequence):
type_b_eulerian
Related sequences ?
Same fingerprint (3)
Equal up to content, sign, reversal and a small index shift.
References
- [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