A133087 → x ↦ x+1 → x ↦ x+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(11 + 3\,x - 7\,n - 2\,n x\right)\,P_{n-1}(x) + \left(21 + 13\,x + 2\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 4 | 1 | 5 | ||||||
| 2 | 9 | 6 | 1 | 16 | |||||
| 3 | 36 | 33 | 10 | 1 | 80 | ||||
| 4 | 81 | 108 | 54 | 12 | 1 | 256 | |||
| 5 | 324 | 513 | 324 | 102 | 16 | 1 | 1280 | ||
| 6 | 729 | 1458 | 1215 | 540 | 135 | 18 | 1 | 4096 | |
| 7 | 2916 | 6561 | 6318 | 3375 | 1080 | 207 | 22 | 1 | 20480 |
Compute more
?
Technical details
- Node id
n-d8b2fe687f6a4e6e· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-69bbf457349d7fd6
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
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 4, 1; 2: 9, 6, 1; 3: 36, 33, 10, 1; 4: 81, 108, 54, 12, 1; 5: 324, 513, 324, 102, 16, 1; 6: 729, 1458, 1215, 540, 135, 18, 1; 7: 2916, 6561, 6318, 3375, 1080, 207, 22, 1; 8: 6561, 17496, 20412, 13608, 5670, 1512, 252, 24, 1; 9: 26244, 76545, 99144, 74844, 36288, 11718, 2520, 348, 28, 1;
%F FormulaThe row polynomials satisfy P(n,x) = -(7*n-11+(2*n-3)*x)*P(n-1,x) + (21+13*x+2*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[-(7*n - 11 + (2*n - 3)*x)*P[n - 1, x] + (21 + 13*x + 2*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] = -(7*n - 11 + (2*n - 3)*x)*v[i - 1] + (21 + 13*x + 2*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)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of A133080 * A007318.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
A133080 * A007318.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of A133080 * A007318.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
reversal of A133080 * A007318.?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
A133080 * A007318.?
-
-
from
shift_x_plus_one of A133080 * A007318.?
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.