A135089 → basis A008277

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
110515
22025550
34095455185
480325275705755
51601055142562510053370
63203325675545501225135516315
7640102953034529505119002170175585035
Technical details
Node id
n-1c97bc7b83045221 · revision 0 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-b5f1389370a379f1

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:   10,     5;
  2:   20,    25,      5;
  3:   40,    95,     45,       5;
  4:   80,   325,    275,      70,      5;
  5:  160,  1055,   1425,     625,    100,      5;
  6:  320,  3325,   6755,    4550,   1225,    135,     5;
  7:  640, 10295,  30345,   29505,  11900,   2170,   175,    5;
  8: 1280, 31525, 131675,  177870, 100905,  27090,  3570,  220,   5;
  9: 2560, 95855, 558225, 1021025, 783300, 290535, 55650, 5550, 270, 5;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (2*n-2+(n-1)*x)*P(n-1,x) + (n-1)*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 10 + 5*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 10 + 5*x;
P[n_, x_] := P[n, x] = Expand[Together[((2*n - 2 + (n - 1)*x)*P[n - 1, x] + (n - 1)*x*D[P[n - 1, x], x])/(n - 1)]];
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] = 10 + 5*x; for(n = 2, N, my(i = n + 1); v[i] = ((2*n - 2 + (n - 1)*x)*v[i - 1] + (n - 1)*x*deriv(v[i - 1], x))/(n - 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)

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.