A367270 → basis A013611 → θ+1

nonnegative coefficients

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

Recurrence

\(\left(n - 3\,n^{2} + 4\,n^{2} x + 2\,n^{3} - 8\,n^{3} x + 4\,n^{4} x\right)\,P_{n}(x) = \left(-2 - 16\,x - 32\,x^{2} + 10\,n + 64\,n x + 80\,n x^{2} - 16\,n^{2} - 72\,n^{2} x - 32\,n^{2} x^{2} + 8\,n^{3} + 8\,n^{3} x - 64\,n^{3} x^{2} + 16\,n^{4} x + 48\,n^{4} x^{2}\right)\,P_{n-1}(x) + \left(-x - 8\,x^{2} - 16\,x^{3} + 4\,n x + 24\,n x^{2} + 32\,n x^{3} - 4\,n^{2} x - 16\,n^{2} x^{2} - 8\,n^{3} x^{2} - 32\,n^{3} x^{3}\right)\,P_{n-1}'(x)\)

\(P_{0}(x) = 1\)

\(P_{1}(x) = 1\)

Rows ?

n	x⁰	x¹	x²	x³	x⁴	x⁵	x⁶	P_n(1)
0	1							1
1	1							1
2	3	16						19
3	10	96	144					250
4	35	480	1440	1024				2979
5	126	2240	10080	15360	6400			34206
6	462	10080	60480	143360	134400	36864		385646
7	1716	44352	332640	1075200	1612800	1032192	200704	4299604

All 15 rows

Technical details

Node id: n-d02f25eeac4c5876 · revision 0 · JSON
Definition source: derived:theta_plus_one
Fingerprint: f6-2ed07f4da6f413f4

Observed on the stored rows ?

Degrees: 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (irregular)
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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x

%e Example

Triangle begins:
  0:     1;
  1:     1;
  2:     3,     16;
  3:    10,     96,     144;
  4:    35,    480,    1440,     1024;
  5:   126,   2240,   10080,    15360,      6400;
  6:   462,  10080,   60480,   143360,    134400,     36864;
  7:  1716,  44352,  332640,  1075200,   1612800,   1032192,    200704;
  8:  6435, 192192, 1729728,  7096320,  14784000,  15482880,   7225344,  1048576;
  9: 24310, 823680, 8648640, 43051008, 115315200, 170311680, 132464640, 47185920, 5308416;

%F Formula

The row polynomials satisfy (2*n^3-3*n^2+n+(4*n^4-8*n^3+4*n^2)*x)*P(n,x) = (8*n^3-16*n^2+10*n-2+(16*n^4+8*n^3-72*n^2+64*n-16)*x+(48*n^4-64*n^3-32*n^2+80*n-32)*x^2)*P(n-1,x) - ((4*n^2-4*n+1)*x+(8*n^3+16*n^2-24*n+8)*x^2+(32*n^3-32*n+16)*x^3)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.

%t Mathematica

P[0, x_] := 1;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((8*n^3 - 16*n^2 + 10*n - 2 + (16*n^4 + 8*n^3 - 72*n^2 + 64*n - 16)*x + (48*n^4 - 64*n^3 - 32*n^2 + 80*n - 32)*x^2)*P[n - 1, x] - ((4*n^2 - 4*n + 1)*x + (8*n^3 + 16*n^2 - 24*n + 8)*x^2 + (32*n^3 - 32*n + 16)*x^3)*D[P[n - 1, x], x])/(2*n^3 - 3*n^2 + n + (4*n^4 - 8*n^3 + 4*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; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((8*n^3 - 16*n^2 + 10*n - 2 + (16*n^4 + 8*n^3 - 72*n^2 + 64*n - 16)*x + (48*n^4 - 64*n^3 - 32*n^2 + 80*n - 32)*x^2)*v[i - 1] - ((4*n^2 - 4*n + 1)*x + (8*n^3 + 16*n^2 - 24*n + 8)*x^2 + (32*n^3 - 32*n + 16)*x^3)*deriv(v[i - 1], x))/(2*n^3 - 3*n^2 + n + (4*n^4 - 8*n^3 + 4*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

Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
by Laguerre’s theorem on multiplier sequences
Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
by Laguerre’s theorem on multiplier sequences

Proof chains ? JSON

Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
- from basis_map_A013611 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).?
  - Geometric basis map (elementary) polytool ? step ›
    
    from Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).?
    
    Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ? step › direct check
    
    Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
    
    Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
  - Geometric basis map (elementary) polytool ? step ›
    
    from Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).?
    
    ↑ Three-term recurrence criterion (above)
    
    ↑ Row-hypergeometric rows (multiplier sequences) (above)
    
    ↑ Liu–Wang theorem for three-term recurrences (above)

References

[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
[Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
[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
[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