A272866 → Veronese 2

palindromic γ-positive nonnegative coefficients

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

Recurrence
\(P_{n}(x) = \left(2 + 2\,x\right)\,P_{n-1}(x) + \left(-1 + 7\,x - x^{2}\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1112
2111113
313030162
4158195581313
51956856859511562
6114117703989177014117813
71196380115533155333801196139062
81260721046928865154692872102601195313
9133312510119154356283356283119154125103331976562
101415202952666101185645193688111856452666102029541514882813
11150631240541893336979582635968263596336979554189331240506124414062
121606461011021306848370629362806442412612936280684837061021306461016061122070313
131715657151811095194022409047610019341991519341991590476100194022401811095657157151610351562
1418339100030544154104600524875851072060670510246428757206067052487585104104600530544159100083313051757813

Generated b-files: A081340 (row sums) ?

Computed in your browser ?

Technical details
Node id
n-78b19c28b9f05152 · revision 1 · JSON
Definition source
derived:veronese_section_2_0
Fingerprint
f6-bc40bb5ac844b706

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: yes
  • γ-positive (gamma_positive): yes
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): no

OEIS matches ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

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,   1;
  2: 1,  11,     1;
  3: 1,  30,    30,      1;
  4: 1,  58,   195,     58,      1;
  5: 1,  95,   685,    685,     95,      1;
  6: 1, 141,  1770,   3989,   1770,    141,      1;
  7: 1, 196,  3801,  15533,  15533,   3801,    196,     1;
  8: 1, 260,  7210,  46928,  86515,  46928,   7210,   260,   1;
  9: 1, 333, 12510, 119154, 356283, 356283, 119154, 12510, 333, 1;
%F Formula
The row polynomials satisfy P(n,x) = (2+2*x)*P(n-1,x) - (1-7*x+x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[(2 + 2*x)*P[n - 1, x] - (1 - 7*x + x^2)*P[n - 2, 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] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (2 + 2*x)*v[i - 1] - (1 - 7*x + x^2)*v[i - 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-864f7f13d69989fc
  • 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-864f7f13d69989fc
  • 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-864f7f13d69989fc

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

No candidate equalities or related sequences.

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. [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