Real-rooted atlas

basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial(n + 1, k - 1)/(n + 1).

Proved for all n: all roots real, in (−∞, 1] · interlacing (weak) what this means

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1022
2-2233
30-8844
45-10-152055
5030-60-104066
6-144263-196357077
70-112336-56-44816811288

Show all 15 stored rows

Generated b-files: A000027 (row sums) ?

Computed in your browser ?

Technical details
Node id
n-01439b9265fd744f · revision 1 · JSON
Definition source
derived:basis_map_coefficients_of:oeis_catalog:A145596
Fingerprint
f6-2cffbe18f65465d6

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): no
  • 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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:   1;
  1:   0,    2;
  2:  -2,    2,     3;
  3:   0,   -8,     8,    4;
  4:   5,  -10,   -15,   20,    5;
  5:   0,   30,   -60,  -10,   40,     6;
  6: -14,   42,    63, -196,   35,    70,    7;
  7:   0, -112,   336,  -56, -448,   168,  112,    8;
  8:  42, -168,  -252, 1344, -840,  -756,  462,  168,   9;
  9:   0,  420, -1680,  840, 3360, -3360, -840, 1020, 240, 10;
%F Formula
The row polynomials satisfy -((1/3)*n^2+(4/3)*n)*P(n,x) = -((2/3)*n^2+(5/3)*n+1)*x*P(n-1,x) + ((4/3)*n^2+(4/3)*n-((4/3)*n^2+(4/3)*n)*x+((1/3)*n^2+(1/3)*n)*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2*x;
P[n_, x_] := P[n, x] = Expand[Together[(-((2/3)*n^2 + (5/3)*n + 1)*x*P[n - 1, x] + ((4/3)*n^2 + (4/3)*n - ((4/3)*n^2 + (4/3)*n)*x + ((1/3)*n^2 + (1/3)*n)*x^2)*P[n - 2, x])/(-(1/3)*n^2 - (4/3)*n)]];
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] = 2*x; for(n = 2, N, my(i = n + 1); v[i] = (-((2/3)*n^2 + (5/3)*n + 1)*x*v[i - 1] + ((4/3)*n^2 + (4/3)*n - ((4/3)*n^2 + (4/3)*n)*x + ((1/3)*n^2 + (1/3)*n)*x^2)*v[i - 2])/(-(1/3)*n^2 - (4/3)*n)); 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, 1]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-3babd9179153850c
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-3babd9179153850c
  • Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-8ef8162b0ed7a444

Proof chains

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

Used in 4 proof steps

No candidate equalities or related sequences.

References

  1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
  2. [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
  3. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023