type_b_eulerian → γ (scale 1/4) → D
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 | Pn(1) |
|---|---|---|---|---|
| 0 | 0 | |||
| 1 | 0 | |||
| 2 | 1 | 1 | ||
| 3 | 5 | 5 | ||
| 4 | 18 | 10 | 28 | |
| 5 | 58 | 122 | 180 | |
| 6 | 179 | 958 | 183 | 1320 |
| 7 | 543 | 6222 | 4155 | 10920 |
Generated b-files: A006157 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-add6df1ce75e6a78· revision 1 · JSON- Definition source
derived:derivative- Fingerprint
f6-9bba25034ade8934
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
OEIS matches ?
- A006157: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 2 ?
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: 0; 2: 1; 3: 5; 4: 18, 10; 5: 58, 122; 6: 179, 958, 183; 7: 543, 6222, 4155; 8: 1636, 36540, 57084, 5540; 9: 4916, 202332, 618828, 202084;
%F FormulaThe row polynomials satisfy (n-2)*P(n,x) = -(3*n-3+(2*n^2-10*n+8)*x+(n^3-7*n^2+14*n-8)*x^2)*P(n-2,x) - ((2*n-2)*x+(2*n^2-8*n+6)*x^2-(2*n^2-6*n+4)*x^3)*d/dx P(n-2,x) + (4*n-7+(2*n^2-10*n+12)*x)*P(n-1,x) + ((2*n-4)*x-(2*n-4)*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 1.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(3*n - 3 + (2*n^2 - 10*n + 8)*x + (n^3 - 7*n^2 + 14*n - 8)*x^2)*P[n - 2, x] - ((2*n - 2)*x + (2*n^2 - 8*n + 6)*x^2 - (2*n^2 - 6*n + 4)*x^3)*D[P[n - 2, x], x] + (4*n - 7 + (2*n^2 - 10*n + 12)*x)*P[n - 1, x] + ((2*n - 4)*x - (2*n - 4)*x^2)*D[P[n - 1, x], x])/(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] = 1; for(n = 3, N, my(i = n + 1); v[i] = (-(3*n - 3 + (2*n^2 - 10*n + 8)*x + (n^3 - 7*n^2 + 14*n - 8)*x^2)*v[i - 2] - ((2*n - 2)*x + (2*n^2 - 8*n + 6)*x^2 - (2*n^2 - 6*n + 4)*x^3)*deriv(v[i - 2], x) + (4*n - 7 + (2*n^2 - 10*n + 12)*x)*v[i - 1] + ((2*n - 4)*x - (2*n - 4)*x^2)*deriv(v[i - 1], x))/(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)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-6301aab0e71cd09e -
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-6301aab0e71cd09e -
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-6301aab0e71cd09e
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
-
preserver_image derivative_polynomial, shift 0
e-6301aab0e71cd09eLaguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
gamma_polynomial scale 1/4, shift 0
e-4c46966ead0b055fGamma 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
-
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.
Related sequences ?
No candidate equalities or related sequences.
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.