Real-rooted atlas

A089231 → x ↦ x+1 → reverse

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1235
26181337
32410815673361
4120720156014605014361
57205400156002190015030405162701
6504045360163800306600315630170142376331044205
7403204233601834560429240058917604763976210744839435319748177

All 15 rows

Technical details
Node id
n-9773dd1e68071da9 · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-01d09cfb9e6b0947

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:       2,        3;
  2:       6,       18,        13;
  3:      24,      108,       156,        73;
  4:     120,      720,      1560,      1460,        501;
  5:     720,     5400,     15600,     21900,      15030,       4051;
  6:    5040,    45360,    163800,    306600,     315630,     170142,      37633;
  7:   40320,   423360,   1834560,   4292400,    5891760,    4763976,    2107448,     394353;
  8:  362880,  4354560,  22014720,  61810560,  106051680,  114335424,   75868128,   28393416,   4596553;
  9: 3628800, 48988800, 283046400, 927158400, 1908930240, 2572547040, 2276043840, 1277703720, 413689770, 58941091;
%F Formula
The row polynomials satisfy P(n,x) = (n+1+3*x-(n-1)*x^2)*P(n-1,x) + (x+2*x^2+x^3)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(n + 1 + 3*x - (n - 1)*x^2)*P[n - 1, x] + (x + 2*x^2 + x^3)*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; for(n = 1, N, my(i = n + 1); v[i] = (n + 1 + 3*x - (n - 1)*x^2)*v[i - 1] + (x + 2*x^2 + x^3)*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

Proof chains ? JSON

Candidate equalities ?

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.