A131431 → (θ+1)² → D+1

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1161632
2012663189
300480160640
400013003251625
5000028805763456
60000055869316517
70000009856140811264
Technical details
Node id
n-fac636095264228a · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-2327141074f67bdf

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 ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:  1;
  1: 16,  16;
  2:  0, 126,  63;
  3:  0,   0, 480,  160;
  4:  0,   0,   0, 1300,  325;
  5:  0,   0,   0,    0, 2880,  576;
  6:  0,   0,   0,    0,    0, 5586,  931;
  7:  0,   0,   0,    0,    0,    0, 9856,  1408;
  8:  0,   0,   0,    0,    0,    0,    0, 16200,  2025;
  9:  0,   0,   0,    0,    0,    0,    0,     0, 25200, 2800;
%F Formula
The row polynomials satisfy (3*n^4-5*n^3+2*n^2+(3*n^3-2*n^2)*x)*P(n,x) = ((3*n^4+7*n^3+5*n^2+n)*x+(3*n^3+7*n^2+5*n+1)*x^2)*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[Together[(((3*n^4 + 7*n^3 + 5*n^2 + n)*x + (3*n^3 + 7*n^2 + 5*n + 1)*x^2)*P[n - 1, x])/(3*n^4 - 5*n^3 + 2*n^2 + (3*n^3 - 2*n^2)*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] = (((3*n^4 + 7*n^3 + 5*n^2 + n)*x + (3*n^3 + 7*n^2 + 5*n + 1)*x^2)*v[i - 1])/(3*n^4 - 5*n^3 + 2*n^2 + (3*n^3 - 2*n^2)*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

Same fingerprint ?

References

  1. [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
  2. [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
  3. [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
  4. [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
  5. [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
  6. [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
  7. [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
  8. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.