A013609 → (θ+1)²

nonnegative coefficients

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1189
21163653
3124108128261
41322165124001161
51403601280200011524833
6148540256060006912313619197
71567564480140002419221952819273629
8164100871682800064512878086553620736274833
917212961075250400145152263424294912186624512001003833
10180162015360840002903046585609830409331205120001239043601989
111881980211201320005322241448832270336034214402816000136294429491212734901
121962376281601980009123842897664648806410264320112640008177664353894469222444463897
13110428083660828600014826245381376140574722668723236608000354365442300313689989121605632153586449
14111232764659240040023063049417408281149446227020810250240012402790410734796862992384224788483686400525595149

Computed in your browser ?

Technical details
Node id
n-03f76cccc35ea4e0 · revision 1 · JSON
Definition source
derived:theta_plus_one_squared
Fingerprint
f6-181bf1738e48841f

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

OEIS matches ?

No OEIS matches.

OEIS submission text ?

Fields to paste into an OEIS submission: the example %e, the formula %F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows. For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched; the matched terms were compared with the published ones, which identifies the node with the entry on a finite prefix, not for every n. The PARI/GP program is not machine-checked here.

The atlas's own rows: n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 1,  8;
  2: 1, 16,   36;
  3: 1, 24,  108,   128;
  4: 1, 32,  216,   512,   400;
  5: 1, 40,  360,  1280,  2000,   1152;
  6: 1, 48,  540,  2560,  6000,   6912,   3136;
  7: 1, 56,  756,  4480, 14000,  24192,  21952,   8192;
  8: 1, 64, 1008,  7168, 28000,  64512,  87808,  65536,  20736;
  9: 1, 72, 1296, 10752, 50400, 145152, 263424, 294912, 186624, 51200;
%F Formula
The row polynomials satisfy (1+(6*n-2)*x+4*n^2*x^2)*P(n,x) = (1+(6*n+6)*x+(4*n^2+20*n+12)*x^2+(8*n^2+16*n+8)*x^3)*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[Together[((1 + (6*n + 6)*x + (4*n^2 + 20*n + 12)*x^2 + (8*n^2 + 16*n + 8)*x^3)*P[n - 1, x])/(1 + (6*n - 2)*x + 4*n^2*x^2)]];
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] = ((1 + (6*n + 6)*x + (4*n^2 + 20*n + 12)*x^2 + (8*n^2 + 16*n + 8)*x^3)*v[i - 1])/(1 + (6*n - 2)*x + 4*n^2*x^2)); 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)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-cb6823c49bab7cdf
  • Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
    All coefficients of each polynomial have the same sign (after x -> -x when alternating).
    derived from the cited steps by a stated theorem: e-cb6823c49bab7cdf
  • Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
    Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
    derived from the cited steps by a stated theorem: e-cb6823c49bab7cdf
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-cb6823c49bab7cdf

Proof chains

1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

Same fingerprint (1)

Equal up to content, sign, reversal and a small index shift.

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