Real-rooted atlas

A106246 → basis A007318 → basis A007318

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1415
2138122
3383912190
410415278161351
52725203801302011323
6688163215607601952414860
71696481657123640133027328117496

All 15 rows

Technical details
Node id
n-6739edea1e96ea71 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-0eee1346949680ba

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,     1;
  2:   13,     8,     1;
  3:   38,    39,    12,     1;
  4:  104,   152,    78,    16,     1;
  5:  272,   520,   380,   130,    20,     1;
  6:  688,  1632,  1560,   760,   195,    24,    1;
  7: 1696,  4816,  5712,  3640,  1330,   273,   28,   1;
  8: 4096, 13568, 19264, 15232,  7280,  2128,  364,  32,  1;
  9: 9728, 36864, 61056, 57792, 34272, 13104, 3192, 468, 36, 1;
%F Formula
The row polynomials satisfy P(n,x) = (8+12*x+6*x^2+x^3)*P(n-3,x) - (12+12*x+3*x^2)*P(n-2,x) + (6+3*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 4 + x, P(2,x) = 13 + 8*x + x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + x;
P[2, x_] := 13 + 8*x + x^2;
P[n_, x_] := P[n, x] = Expand[(8 + 12*x + 6*x^2 + x^3)*P[n - 3, x] - (12 + 12*x + 3*x^2)*P[n - 2, x] + (6 + 3*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 + x; v[3] = 13 + 8*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = (8 + 12*x + 6*x^2 + x^3)*v[i - 3] - (12 + 12*x + 3*x^2)*v[i - 2] + (6 + 3*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

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.