A202241 → basis A008277

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1314
256112
392310143
4187863151175
536252330138211778
672792157210202642813749
7144244870806672260446036119445
Technical details
Node id
n-a22ad4ac78d38d01 · revision 0 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-5311dcbef1714f6f

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:   3,     1;
  2:   5,     6,      1;
  3:   9,    23,     10,      1;
  4:  18,    78,     63,     15,      1;
  5:  36,   252,    330,    138,     21,     1;
  6:  72,   792,   1572,   1020,    264,    28,     1;
  7: 144,  2448,   7080,   6672,   2604,   460,    36,    1;
  8: 288,  7488,  30768,  40440,  22296,  5824,   748,   45,  1;
  9: 576, 22752, 130560, 232968, 174216, 63064, 11808, 1153, 55, 1;
%F Formula
The row polynomials satisfy (n-3)*P(n,x) = (2*n-6+(n-3)*x)*P(n-1,x) + (n-3)*x*d/dx P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 3 + x, P(2,x) = 5 + 6*x + x^2, P(3,x) = 9 + 23*x + 10*x^2 + x^3.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + x;
P[2, x_] := 5 + 6*x + x^2;
P[3, x_] := 9 + 23*x + 10*x^2 + x^3;
P[n_, x_] := P[n, x] = Expand[Together[((2*n - 6 + (n - 3)*x)*P[n - 1, x] + (n - 3)*x*D[P[n - 1, x], x])/(n - 3)]];
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] = 3 + x; v[3] = 5 + 6*x + x^2; v[4] = 9 + 23*x + 10*x^2 + x^3; for(n = 4, N, my(i = n + 1); v[i] = ((2*n - 6 + (n - 3)*x)*v[i - 1] + (n - 3)*x*deriv(v[i - 1], x))/(n - 3)); 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

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