A225470 → basis A007318
nonnegative coefficients only rational roots
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 | 3 | 1 | 4 | ||||||
| 2 | 18 | 9 | 1 | 28 | |||||
| 3 | 162 | 99 | 18 | 1 | 280 | ||||
| 4 | 1944 | 1350 | 315 | 30 | 1 | 3640 | |||
| 5 | 29160 | 22194 | 6075 | 765 | 45 | 1 | 58240 | ||
| 6 | 524880 | 428652 | 131544 | 19845 | 1575 | 63 | 1 | 1106560 | |
| 7 | 11022480 | 9526572 | 3191076 | 548289 | 52920 | 2898 | 84 | 1 | 24344320 |
Computed in your browser ?
Technical details
- Node id
n-b6cbf920aaa38713· revision 1 · JSON- Definition source
derived:basis_map_A007318- Fingerprint
f6-bc84b3931f09589a
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 ℚ): yes
OEIS matches ?
- A007559: row sums, 15 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: 1; 1: 3, 1; 2: 18, 9, 1; 3: 162, 99, 18, 1; 4: 1944, 1350, 315, 30, 1; 5: 29160, 22194, 6075, 765, 45, 1; 6: 524880, 428652, 131544, 19845, 1575, 63, 1; 7: 11022480, 9526572, 3191076, 548289, 52920, 2898, 84, 1; 8: 264539520, 239660208, 86112396, 16350012, 1818369, 122472, 4914, 108, 1; 9: 7142567040, 6735365136, 2564694900, 527562720, 65445975, 5125113, 255150, 7830, 135, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (3*n+x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(3*n + x)*P[n - 1, 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] = (3*n + x)*v[i - 1]); 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-b2419cddc44d1315 -
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-b2419cddc44d1315 -
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-b2419cddc44d1315
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 A007318
e-b2419cddc44d1315Geometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-9b3c7c87e4baebfbroot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A007318
e-8562aab4e97e2e3fGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-1844ef33b5ef77b8root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers root_domain
e-576aa1dc371fa216root: theorem checkParent-row provers of polytool polytool ?
-
basis_map A007318
e-fe032cf3f375eb62Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers root_domain
e-aa6a1f197b91b3b6root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…
-
-
premise (sequence):
Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1…
-
parent_provers root_domain
e-c0733b4d3f559bd0root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows, s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.
Related sequences ?
Same fingerprint (1)
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