A028326 → basis A013611 → basis A008277

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
022
112820
27212832232
343215689601283088
425921740819712614451246368
515552184448345600189440358402048772928
6933121906688557619247923201546240196608819214119552
755987219440128856934401085665285318656011296768103219232768279808256
Technical details
Node id
n-a4fd53d9bf6db01c · revision 0 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-5162632e955115eb

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:        2;
  1:       12,          8;
  2:       72,        128,          32;
  3:      432,       1568,         960,         128;
  4:     2592,      17408,       19712,        6144,         512;
  5:    15552,     184448,      345600,      189440,       35840,        2048;
  6:    93312,    1906688,     5576192,     4792320,     1546240,      196608,       8192;
  7:   559872,   19440128,    85693440,   108566528,    53186560,    11296768,    1032192,     32768;
  8:  3359232,  196640768,  1277468672,  2296971264,  1604370432,   506462208,   76152832,   5242880,   131072;
  9: 20155392, 1979844608, 18671124480, 46455357440, 44484034560, 19585499136, 4310433792, 482869248, 25952256, 524288;
%F Formula
The row polynomials satisfy P(n,x) = (6+4*x)*P(n-1,x) + 4*x*d/dx P(n-1,x) for n >= 1, with P(0,x) = 2.
%t Mathematica
P[0, x_] := 2;
P[n_, x_] := P[n, x] = Expand[(6 + 4*x)*P[n - 1, x] + 4*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] = 2; for(n = 1, N, my(i = n + 1); v[i] = (6 + 4*x)*v[i - 1] + 4*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

Same fingerprint ?

References

  1. [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
  2. [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
  3. [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
  4. [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
  5. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.