A007318 → ×(1+2n+n²) → D+1

nonnegative coefficients only rational roots

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
18412
22736972
3641449616320
4125400450200251200
521690014401080360364032
634317643675392022055884912544
75123136806411200896040328966436864
87295184158762721628350181446804129681103680
9100081002880058800756006300033600108001800100281600
101331121004900511616017787018295212705058080163352420121743424
1117281742479200213840380160465696399168237600950402376031681441916928
12219724336122694371800752895107078410930928030884182751487203346240561694845568
132744331241834566166161401400227026826906882354352151351270070022422445864509619612042240
14337544100266175982800247747545045006081075617760047297252702700112612532760061425630022529491200

Computed in your browser ?

Technical details
Node id
n-441d800dafd42935 · revision 1 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-e99c3824c4864868

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

OEIS matches ?

No OEIS matches.

OEIS submission text ?

Fields to paste into an OEIS submission: the example %e, the formula %F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows. For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched; the matched terms were compared with the published ones, which identifies the node with the entry on a finite prefix, not for every n. The PARI/GP program is not machine-checked here.

The atlas's own rows: n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:    1;
  1:    8,    4;
  2:   27,   36,     9;
  3:   64,  144,    96,    16;
  4:  125,  400,   450,   200,    25;
  5:  216,  900,  1440,  1080,   360,    36;
  6:  343, 1764,  3675,  3920,  2205,   588,    49;
  7:  512, 3136,  8064, 11200,  8960,  4032,   896,    64;
  8:  729, 5184, 15876, 27216, 28350, 18144,  6804,  1296,   81;
  9: 1000, 8100, 28800, 58800, 75600, 63000, 33600, 10800, 1800, 100;
%F Formula
The row polynomials satisfy (n^4-2*n^3+n^2)*P(n,x) = -(n^4+2*n^3+n^2+(2*n^4+4*n^3+2*n^2)*x+(n^4+2*n^3+n^2)*x^2)*P(n-2,x) + (2*n^4-4*n^2+2+(2*n^4-4*n^2+2)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 8 + 4*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 8 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^4 + 2*n^3 + n^2 + (2*n^4 + 4*n^3 + 2*n^2)*x + (n^4 + 2*n^3 + n^2)*x^2)*P[n - 2, x] + (2*n^4 - 4*n^2 + 2 + (2*n^4 - 4*n^2 + 2)*x)*P[n - 1, x])/(n^4 - 2*n^3 + n^2)]];
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] = 8 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^4 + 2*n^3 + n^2 + (2*n^4 + 4*n^3 + 2*n^2)*x + (n^4 + 2*n^3 + n^2)*x^2)*v[i - 2] + (2*n^4 - 4*n^2 + 2 + (2*n^4 - 4*n^2 + 2)*x)*v[i - 1])/(n^4 - 2*n^3 + n^2)); 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)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-8324da2f35d5f52e
  • Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
    All coefficients of each polynomial have the same sign (after x -> -x when alternating).
    derived from the cited steps by a stated theorem: e-8324da2f35d5f52e
  • Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
    Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
    derived from the cited steps by a stated theorem: e-8324da2f35d5f52e

Proof chains

1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

Same fingerprint (27)

Equal up to content, sign, reversal and a small index shift.

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