Real-rooted atlas

A099040 → basis A007318 → basis A008277

nonnegative coefficients

Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel

Recurrence

\(P_{n}(x) = \left(4 + 2\,x\right)\,P_{n-2}(x) + \left(2\,x\right)\,P_{n-2}'(x) + \left(4 + 2\,x\right)\,P_{n-1}(x) + \left(2\,x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + 2\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1426
22022446
396192808376
446415161100248163344
52240113681285649207043232120
610816827121374167959218976188864331464
752224590592139033611456644051846624048641283655232

All 15 rows

Technical details
Node id
n-3b34659855d92bfc · revision 0 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-b9ca97c881366b5c

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 Example
Triangle begins:
  0:       1;
  1:       4,        2;
  2:      20,       22,         4;
  3:      96,      192,        80,         8;
  4:     464,     1516,      1100,       248,        16;
  5:    2240,    11368,     12856,      4920,       704,       32;
  6:   10816,    82712,    137416,     79592,     18976,     1888,      64;
  7:   52224,   590592,   1390336,   1145664,    405184,    66240,    4864,    128;
  8:  252160,  4165904,  13568624,  15308064,   7540432,  1802112,  215104,  12160,   256;
  9: 1217536, 29147744, 129184672, 194455200, 128254848, 42048160, 7256192, 661120, 29696, 512;
%F Formula
The row polynomials satisfy P(n,x) = (4+2*x)*P(n-2,x) + 2*x*d/dx P(n-2,x) + (4+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 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + 2*x;
P[n_, x_] := P[n, x] = Expand[(4 + 2*x)*P[n - 2, x] + 2*x*D[P[n - 2, x], x] + (4 + 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/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 4 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (4 + 2*x)*v[i - 2] + 2*x*deriv(v[i - 2], x) + (4 + 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]
    by Ray basis map theorem
  • 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

Same fingerprint ?

References

  1. [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
  2. [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