A028338 → x ↦ x+1 → θ+1

nonnegative coefficients

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

Recurrence

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

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

\(P_{1}(x) = 2 + 2\,x\)

Rows ?

n	x⁰	x¹	x²	x³	x⁴	x⁵	x⁶	x⁷	P_n(1)
0	1								1
1	2	2							4
2	8	12	3						23
3	48	88	36	4					176
4	384	800	420	80	5				1689
5	3840	8768	5400	1360	150	6			19524
6	46080	112896	77952	23520	3500	252	7		264207
7	645120	1672704	1260672	433216	78400	7728	392	8	4098240

All 15 rows

Technical details

Node id: n-8802fa67ca7b6a9f · revision 0 · JSON
Definition source: derived:theta_plus_one
Fingerprint: f6-959faa625dfaa291

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 ℚ): no

Matches ?

No OEIS matches.

Submission text ?

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

%e Example

Triangle begins:
  0:         1;
  1:         2,         2;
  2:         8,        12,         3;
  3:        48,        88,        36,         4;
  4:       384,       800,       420,        80,        5;
  5:      3840,      8768,      5400,      1360,      150,       6;
  6:     46080,    112896,     77952,     23520,     3500,     252,      7;
  7:    645120,   1672704,   1260672,    433216,    78400,    7728,    392,     8;
  8:  10321920,  28053504,  22679808,   8612352,  1795920,  217728,  15288,   576,   9;
  9: 185794560, 525606912, 450316800, 185262080, 43092000, 6074208, 529200, 27840, 810, 10;

%F Formula

The row polynomials satisfy P(n,x) = -(4*n^2-8*n+4+(4*n-4)*x+x^2)*P(n-2,x) + (4*n-2+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.

%t Mathematica

P[0, x_] := 1;
P[1, x_] := 2 + 2*x;
P[n_, x_] := P[n, x] = Expand[-(4*n^2 - 8*n + 4 + (4*n - 4)*x + x^2)*P[n - 2, x] + (4*n - 2 + 2*x)*P[n - 1, 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] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(4*n^2 - 8*n + 4 + (4*n - 4)*x + x^2)*v[i - 2] + (4*n - 2 + 2*x)*v[i - 1]); 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 ≥ 1
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_A007318 of Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.?
  - Geometric basis map (elementary) polytool ? step ›
    
    from Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.?
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? step › direct check
    
    Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
    
    Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
    
    from Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? step › direct check
    
    Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
    
    from Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.?
    
    ↑ Liu–Wang theorem (above)
    
    ↑ Iterated real-rootedness preservers (above)
    
    Parent-row provers of polytool polytool ? step › direct check
    
    Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
    
    Parent-row provers of polytool polytool ? step › direct check
    
    ↑ Parent-row provers of polytool (above)
  - Geometric basis map (elementary) polytool ? step ›
    
    from Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.?
    
    ↑ Liu–Wang theorem (above)
    
    ↑ Iterated real-rootedness preservers (above)
    
    ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    
    ↑ Parent-row provers of polytool (above)
  - Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
    
    from Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.?
    
    ↑ Liu–Wang theorem (above)
    
    ↑ Iterated real-rootedness preservers (above)
    
    ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    
    ↑ Parent-row provers of polytool (above)

Related ?

Same fingerprint ?

References

[Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
[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
[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.