Veronese parent of A098172 → θ+1

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15x16x17x18x19x20x21x22x23Pn(1)
10033
200005611
3000000716932
400000000930331284
500000000001148785615208
600000000000013701501608518496
7000000000000001596255360285120211152
8000000000000000017126399700735462161242624
Technical details
Node id
n-8fec94b874cdd565 · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-76e137d3605ff796

Observed on the stored rows ?

  • Degrees: 2, 5, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 44 (affine: slope 3, intercept -1)
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1: 0, 0, 3;
   2: 0, 0, 0, 0, 5, 6;
   3: 0, 0, 0, 0, 0, 0, 7, 16, 9;
   4: 0, 0, 0, 0, 0, 0, 0,  0, 9, 30, 33, 12;
   5: 0, 0, 0, 0, 0, 0, 0,  0, 0,  0, 11, 48, 78, 56,  15;
   6: 0, 0, 0, 0, 0, 0, 0,  0, 0,  0,  0,  0, 13, 70, 150, 160,  85,  18;
   7: 0, 0, 0, 0, 0, 0, 0,  0, 0,  0,  0,  0,  0,  0,  15,  96, 255, 360, 285, 120,  21;
   8: 0, 0, 0, 0, 0, 0, 0,  0, 0,  0,  0,  0,  0,  0,   0,   0,  17, 126, 399, 700, 735,  462,  161,   24;
   9: 0, 0, 0, 0, 0, 0, 0,  0, 0,  0,  0,  0,  0,  0,   0,   0,   0,   0,  19, 160, 588, 1232, 1610, 1344,  700,  208,   27;
  10: 0, 0, 0, 0, 0, 0, 0,  0, 0,  0,  0,  0,  0,  0,   0,   0,   0,   0,   0,   0,  21,  198,  828, 2016, 3150, 3276, 2268, 1008, 261, 30;
%F Formula
The row polynomials satisfy (2*n-1+(3*n-3)*x)*P(n,x) = ((2*n+1)*x^2+(5*n+1)*x^3+3*n*x^4)*P(n-1,x) for n >= 2, with P(1,x) = 3*x^2.
%t Mathematica
P[1, x_] := 3*x^2;
P[n_, x_] := P[n, x] = Expand[Together[(((2*n + 1)*x^2 + (5*n + 1)*x^3 + 3*n*x^4)*P[n - 1, x])/(2*n - 1 + (3*n - 3)*x)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 3*x^2; for(n = 2, N, my(i = n); v[i] = (((2*n + 1)*x^2 + (5*n + 1)*x^3 + 3*n*x^4)*v[i - 1])/(2*n - 1 + (3*n - 3)*x)); 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)

polytool c48629374597

Properties

Proof chains ? JSON

References

  1. [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
  2. [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
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.