A290319 → basis A013609 → basis A008277
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(2\,x + 4\,n\right)\,P_{n-1}(x) + \left(2\,x\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 | 2 | 6 | ||||||
| 2 | 32 | 28 | 4 | 64 | |||||
| 3 | 384 | 456 | 120 | 8 | 968 | ||||
| 4 | 6144 | 8976 | 3312 | 416 | 16 | 18864 | |||
| 5 | 122880 | 209760 | 97440 | 17440 | 1280 | 32 | 448832 | ||
| 6 | 2949120 | 5699520 | 3147840 | 718080 | 75840 | 3648 | 64 | 12594112 | |
| 7 | 82575360 | 176883840 | 112129920 | 30710400 | 4166400 | 290304 | 9856 | 128 | 406766208 |
Compute more
?
Technical details
- Node id
n-4aa4785d70eabbb3· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-7d048716a74a4e37
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
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 4, 2; 2: 32, 28, 4; 3: 384, 456, 120, 8; 4: 6144, 8976, 3312, 416, 16; 5: 122880, 209760, 97440, 17440, 1280, 32; 6: 2949120, 5699520, 3147840, 718080, 75840, 3648, 64; 7: 82575360, 176883840, 112129920, 30710400, 4166400, 290304, 9856, 128; 8: 2642411520, 6179201280, 4390444800, 1391255040, 228076800, 20525568, 1014272, 25600, 256; 9: 95126814720, 240094471680, 187976194560, 67213601280, 12817889280, 1400329728, 89736192, 3308544, 64512, 512;
%F FormulaThe row polynomials satisfy P(n,x) = (4*n+2*x)*P(n-1,x) + 2*x*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[(4*n + 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; for(n = 1, N, my(i = n + 1); v[i] = (4*n + 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)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Ray basis map theorem
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Ray basis map theorem
Proof chains ? JSON
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
Related ?
Same fingerprint ?
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
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.