A249251 → basis A008277
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 | 4 | 3 | 7 | ||||||
| 2 | 13 | 24 | 6 | 43 | |||||
| 3 | 43 | 156 | 93 | 12 | 304 | ||||
| 4 | 142 | 927 | 1005 | 300 | 24 | 2398 | |||
| 5 | 469 | 5274 | 9324 | 4851 | 876 | 48 | 20842 | ||
| 6 | 1549 | 29304 | 79758 | 64512 | 19758 | 2400 | 96 | 197377 | |
| 7 | 5116 | 160635 | 650160 | 768852 | 355593 | 71880 | 6288 | 192 | 2018716 |
Computed in your browser ?
Technical details
- Node id
n-f313a8b6ef4f8f9f· revision 1 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-d4af535187e7dacc
Observed on the stored rows ?
- Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (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 ?
No OEIS matches.
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: 4, 3; 2: 13, 24, 6; 3: 43, 156, 93, 12; 4: 142, 927, 1005, 300, 24; 5: 469, 5274, 9324, 4851, 876, 48; 6: 1549, 29304, 79758, 64512, 19758, 2400, 96; 7: 5116, 160635, 650160, 768852, 355593, 71880, 6288, 192; 8: 16897, 873564, 5140968, 8557794, 5612529, 1679784, 241152, 15936, 384; 9: 55807, 4728000, 39845019, 91027650, 81400224, 33849123, 7092744, 761040, 39360, 768;
%F FormulaThe row polynomials satisfy P(n,x) = (1+x)*P(n-2,x) + x*d/dx P(n-2,x) + (3+2*x)*P(n-1,x) + 2*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 3*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 4 + 3*x;
P[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 2, x] + x*D[P[n - 2, x], x] + (3 + 2*x)*P[n - 1, x] + 2*x*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; v[2] = 4 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 2] + x*deriv(v[i - 2], x) + (3 + 2*x)*v[i - 1] + 2*x*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.
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-de71ae489694e7d4 -
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-de71ae489694e7d4 -
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-de71ae489694e7d4
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
-
basis_map A008277
e-de71ae489694e7d4Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ?
-
premise (sequence):
Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.
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-67b682ca6511d839root: theorem checkLiu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?
-
preserver_image reversal, shift 0
e-c7b023a4533e2987Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Riordan array ((1+x)/(1-2x),x(1+x)/(1-2x)).
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-ee40b91a84fdd5b7root: theorem checkLiu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?
-
preserver_image reversal, shift 0
e-c36241f3b645d7b5Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.
-
-
premise (sequence):
Riordan array ((1+x)/(1-2x),x(1+x)/(1-2x)).
-
-
premise (sequence):
Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741