narayana → D
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 1 | 0 | |||||||
| 2 | 1 | 1 | ||||||
| 3 | 3 | 2 | 5 | |||||
| 4 | 6 | 12 | 3 | 21 | ||||
| 5 | 10 | 40 | 30 | 4 | 84 | |||
| 6 | 15 | 100 | 150 | 60 | 5 | 330 | ||
| 7 | 21 | 210 | 525 | 420 | 105 | 6 | 1287 | |
| 8 | 28 | 392 | 1470 | 1960 | 980 | 168 | 7 | 5005 |
Generated b-files: A002054 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-28f1bce6fca8e347· revision 1 · JSON- Definition source
derived:derivative- Fingerprint
f6-4e2cf4a8bda0ea40
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (affine: slope 1, intercept -2)
- 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 ?
- A002054: row sums, 14 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 1 ?
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 ExampleTriangle begins: 1: 0; 2: 1; 3: 3, 2; 4: 6, 12, 3; 5: 10, 40, 30, 4; 6: 15, 100, 150, 60, 5; 7: 21, 210, 525, 420, 105, 6; 8: 28, 392, 1470, 1960, 980, 168, 7; 9: 36, 672, 3528, 7056, 5880, 2016, 252, 8; 10: 45, 1080, 7560, 21168, 26460, 15120, 3780, 360, 9;
%F FormulaThe row polynomials satisfy (n^2-n-2)*P(n,x) = (n^2+n+(3*n^2-7*n+2)*x)*P(n-1,x) + ((2*n-1)*x-(2*n-1)*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 1.
%t MathematicaP[1, x_] := 0;
P[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 + n + (3*n^2 - 7*n + 2)*x)*P[n - 1, x] + ((2*n - 1)*x - (2*n - 1)*x^2)*D[P[n - 1, x], x])/(n^2 - n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 0; v[2] = 1; for(n = 3, N, my(i = n); v[i] = ((n^2 + n + (3*n^2 - 7*n + 2)*x)*v[i - 1] + ((2*n - 1)*x - (2*n - 1)*x^2)*deriv(v[i - 1], x))/(n^2 - n - 2)); 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-80d7d7190d4bcb89 -
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-80d7d7190d4bcb89 -
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-80d7d7190d4bcb89 -
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-80d7d7190d4bcb89
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
-
preserver_image derivative_polynomial, shift 0
e-80d7d7190d4bcb89Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
narayana
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check three_term_recurrence
e-46a461774e271ec3root: theorem checkThree-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?
-
preserver_image reversal, shift 0
e-29ef477df4172e22Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
narayana
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
narayana
-
-
premise (sequence):
narayana
Related sequences ?
Same fingerprint (7)
Equal up to content, sign, reversal and a small index shift.
- A352880: Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).
- A001263 → D
- A108838 → reverse
- A007318 → ⊙ C(n+1,k+1) (shift +2) → reverse
- A108838: Triangle of Dyck paths counted by number of long interior inclines.
- A132812 → D
- A062196 → D
References
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023