A286718 → basis A013609 → D+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(-16 + 16\,x - 4\,x^{2} + 24\,n - 12\,n x - 9\,n^{2}\right)\,P_{n-2}(x) + \left(-5 + 4\,x + 6\,n\right)\,P_{n-1}(x)\)

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

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

Rows ?

n	x⁰	x¹	x²	x³	x⁴	x⁵	x⁶	x⁷	P_n(1)
0	1								1
1	4	2							6
2	24	22	4						50
3	212	252	84	8					556
4	2492	3460	1548	272	16				7788
5	36648	56648	30440	7320	800	32			131888
6	647656	1084968	663096	194840	29520	2208	64		2622352
7	13372000	23871104	16078608	5449472	1020880	106848	5824	128	59904864

All 15 rows

Technical details

Node id: n-2ee4e8e5b748e3e9 · revision 0 · JSON
Definition source: derived:one_plus_derivative
Fingerprint: f6-d0e1e8fd131efc14

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:          4,           2;
  2:         24,          22,           4;
  3:        212,         252,          84,          8;
  4:       2492,        3460,        1548,        272,         16;
  5:      36648,       56648,       30440,       7320,        800,        32;
  6:     647656,     1084968,      663096,     194840,      29520,      2208,       64;
  7:   13372000,    23871104,    16078608,    5449472,    1020880,    106848,     5824,     128;
  8:  315933600,   594145792,   432238096,  163318176,   35648144,   4653824,   357504,   14848,   256;
  9: 8406958400, 16518840192, 12801036672, 5274055968, 1294320384, 198388512, 19138560, 1126656, 36864, 512;

%F Formula

The row polynomials satisfy P(n,x) = -(9*n^2-24*n+16+(12*n-16)*x+4*x^2)*P(n-2,x) + (6*n-5+4*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 2*x.

%t Mathematica

P[0, x_] := 1;
P[1, x_] := 4 + 2*x;
P[n_, x_] := P[n, x] = Expand[-(9*n^2 - 24*n + 16 + (12*n - 16)*x + 4*x^2)*P[n - 2, x] + (6*n - 5 + 4*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] = 4 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(9*n^2 - 24*n + 16 + (12*n - 16)*x + 4*x^2)*v[i - 2] + (6*n - 5 + 4*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 differential operators
Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
by Laguerre’s theorem on differential operators

Proof chains ? JSON

Laguerre’s theorem on differential operators [SP14] polytool ? step ›
- from basis_map_A013609 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A …?
  - Geometric basis map (elementary) polytool ? step ›
    
    from Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1…?
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? step › direct check
    
    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
    
    Geometric basis map (elementary) polytool ? step ›
    
    from basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…?
    
    Parent-row provers of polytool polytool ? step › direct check
    
    Geometric basis map (elementary) polytool ? step ›
    
    from basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…?
    
    ↑ Parent-row provers of polytool (above)
    
    Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
    
    from basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…?
    
    ↑ Parent-row provers of polytool (above)
  - Geometric basis map (elementary) polytool ? step ›
    
    from Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1…?
    
    ↑ Liu–Wang theorem (above)
    
    ↑ Parent-row provers of polytool (above)
    
    ↑ Iterated real-rootedness preservers (above)
    
    ↑ Geometric basis map (elementary) (above)
    
    ↑ Geometric basis map (elementary) (above)
    
    ↑ Affine, reversal and Möbius substitutions (elementary) (above)

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.