A286718 → basis A013610 → reverse

nonnegative coefficientsonly rational roots

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

Recurrence

\(P_{n}(x) = \left(3 - x + 3\,n x\right)\,P_{n-1}(x)\)

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

Rows ?

n	x⁰	x¹	x²	x³	x⁴	x⁵	x⁶	x⁷	P_n(1)
0	1								1
1	3	2							5
2	9	21	10						40
3	27	135	198	80					440
4	81	702	2079	2418	880				6160
5	243	3240	16065	36360	36492	12320			104720
6	729	13851	103275	382185	727596	657324	209440		2094400
7	2187	56133	586845	3212055	9826488	16523892	13774800	4188800	48171200

All 15 rows

Technical details

Node id: n-20638f0f407aadcd · revision 0 · JSON
Definition source: derived:reversal
Fingerprint: f6-cfe67b6e4979d755

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

Matches ?

No OEIS matches.

Submission text ?

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

%e Example

Triangle begins:
  0:     1;
  1:     3,      2;
  2:     9,     21,       10;
  3:    27,    135,      198,        80;
  4:    81,    702,     2079,      2418,       880;
  5:   243,   3240,    16065,     36360,     36492,      12320;
  6:   729,  13851,   103275,    382185,    727596,     657324,     209440;
  7:  2187,  56133,   586845,   3212055,   9826488,   16523892,   13774800,     4188800;
  8:  6561, 218700,  3051594,  23133600, 103356729,  275580900,  421373916,   329386800,   96342400;
  9: 19683, 826686, 14840982, 148742244, 911543787, 3514017654, 8429225148, 11943882216, 8853084000, 2504902400;

%F Formula

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

%t Mathematica

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(3 + (3*n - 1)*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; for(n = 1, N, my(i = n + 1); v[i] = (3 + (3*n - 1)*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 Affine, reversal and Möbius substitutions (elementary)
Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Affine, reversal and Möbius substitutions (elementary)
Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Affine, reversal and Möbius substitutions (elementary)

Proof chains ? JSON

Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- from basis_map_A013610 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)

Related ?

Same fingerprint ?

A286718 → basis A013610

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.