Real-rooted atlas

basis-map coefficients of A112227 → basis A013611 → D+1

nonnegative coefficientsonly rational roots

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

Recurrence

\(\left(1 + 4\,x + 4\,n\right)\,P_{n}(x) = \left(5 + 24\,x + 16\,x^{2} + 4\,n + 16\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 9 + 40\,x + 16\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
19401665
21310824064425
31720886412802562625
421340208057606400102415625
5255044080166403456030720409690625
62970070563808011648019353614336016384515625
73392811200752643046407454721032192655360655362890625
837118816704134400677376219340844728325308416294912026214416015625

All 15 rows

Technical details
Node id
n-66b5fd0d041a4c11 · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-236e6d52004bfa9f

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, 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:  9,   40,    16;
   2: 13,  108,   240,     64;
   3: 17,  208,   864,   1280,     256;
   4: 21,  340,  2080,   5760,    6400,     1024;
   5: 25,  504,  4080,  16640,   34560,    30720,     4096;
   6: 29,  700,  7056,  38080,  116480,   193536,   143360,    16384;
   7: 33,  928, 11200,  75264,  304640,   745472,  1032192,   655360,     65536;
   8: 37, 1188, 16704, 134400,  677376,  2193408,  4472832,  5308416,   2949120,    262144;
   9: 41, 1480, 23760, 222720, 1344000,  5419008, 14622720, 25559040,  26542080,  13107200,  1048576;
  10: 45, 1804, 32560, 348480, 2449920, 11827200, 39739392, 91914240, 140574720, 129761280, 57671680, 4194304;
%F Formula
The row polynomials satisfy (4*n+1+4*x)*P(n,x) = (4*n+5+(16*n+24)*x+16*x^2)*P(n-1,x) for n >= 2, with P(1,x) = 9 + 40*x + 16*x^2.
%t Mathematica
P[1, x_] := 9 + 40*x + 16*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((4*n + 5 + (16*n + 24)*x + 16*x^2)*P[n - 1, x])/(4*n + 1 + 4*x)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 9 + 40*x + 16*x^2; for(n = 2, N, my(i = n); v[i] = ((4*n + 5 + (16*n + 24)*x + 16*x^2)*v[i - 1])/(4*n + 1 + 4*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

Same fingerprint ?

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.