narayana → (θ+1)²

nonnegative coefficients

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

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2145
3112922
4124541695
514018016025406
6160450800375361722
718494528002625756497260
811121764784012250705613726430459

Generated b-files: A141222 (row sums) ?

Computed in your browser ?

Technical details
Node id
n-ab83e9966290e807 · revision 1 · JSON
Definition source
derived:theta_plus_one_squared
Fingerprint
f6-a7224e2d1d90f526

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 -1)
  • 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

OEIS matches ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1: 1;
   2: 1,   4;
   3: 1,  12,    9;
   4: 1,  24,   54,    16;
   5: 1,  40,  180,   160,     25;
   6: 1,  60,  450,   800,    375,     36;
   7: 1,  84,  945,  2800,   2625,    756,     49;
   8: 1, 112, 1764,  7840,  12250,   7056,   1372,    64;
   9: 1, 144, 3024, 18816,  44100,  42336,  16464,  2304,   81;
  10: 1, 180, 4860, 40320, 132300, 190512, 123480, 34560, 3645, 100;
%F Formula
The row polynomials satisfy -(n^2-n-(n^4-2*n^3+n^2)*x)*P(n,x) = -(n^2-n-(n^4-2*n^3-5*n^2+10*n-4)*x-(3*n^4-4*n^3-2*n^2+5*n-2)*x^2)*P(n-1,x) - ((2*n-1)*x-2*n^3*x^2+(2*n^3-2*n+1)*x^3)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - n - (n^4 - 2*n^3 - 5*n^2 + 10*n - 4)*x - (3*n^4 - 4*n^3 - 2*n^2 + 5*n - 2)*x^2)*P[n - 1, x] - ((2*n - 1)*x - 2*n^3*x^2 + (2*n^3 - 2*n + 1)*x^3)*D[P[n - 1, x], x])/(-n^2 + n + (n^4 - 2*n^3 + n^2)*x)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (-(n^2 - n - (n^4 - 2*n^3 - 5*n^2 + 10*n - 4)*x - (3*n^4 - 4*n^3 - 2*n^2 + 5*n - 2)*x^2)*v[i - 1] - ((2*n - 1)*x - 2*n^3*x^2 + (2*n^3 - 2*n + 1)*x^3)*deriv(v[i - 1], x))/(-n^2 + n + (n^4 - 2*n^3 + n^2)*x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 1, 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-1770020eb0a9c55e
  • Coefficients of one sign. Every nonzero row, n >= 1: 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-1770020eb0a9c55e
  • Hadamard kernel (Malo). Rows P_n, n >= 1, 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-1770020eb0a9c55e
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-1770020eb0a9c55e

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 (2)

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

References

  1. [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
  2. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
  4. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023