Real-rooted atlas

A034870 → Veronese 2 → basis A013611

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1246
28321656
33219228864576
41281024256020482566016
55125120179202560012800102462976
6204824576110592229376215040737284096659456
78192114688630784172032024084481605632401408163846905856

All 15 rows

Technical details
Node id
n-8174fc58d16e6b93 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-4a6fdd8c1c3f626a

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,       4;
  2:      8,      32,       16;
  3:     32,     192,      288,       64;
  4:    128,    1024,     2560,     2048,       256;
  5:    512,    5120,    17920,    25600,     12800,      1024;
  6:   2048,   24576,   110592,   229376,    215040,     73728,      4096;
  7:   8192,  114688,   630784,  1720320,   2408448,   1605632,    401408,    16384;
  8:  32768,  524288,  3407872, 11534336,  21626880,  22020096,  11010048,  2097152,    65536;
  9: 131072, 2359296, 17694720, 71565312, 168689664, 233570304, 181665792, 70778880, 10616832, 262144;
%F Formula
The row polynomials satisfy P(n,x) = -16*x^2*P(n-2,x) + (4+8*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 4*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 4*x;
P[n_, x_] := P[n, x] = Expand[-16*x^2*P[n - 2, x] + (4 + 8*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 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -16*x^2*v[i - 2] + (4 + 8*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

Proof chains ? JSON

Same fingerprint ?

References

  1. [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
  2. [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
  3. [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
  4. [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
  5. [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
  6. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.