A178821 → Veronese 2

nonnegative coefficients

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

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
155
2151530
335105140
47042070560
512612606302016
6210315031502106720
7330693011550231021120
849513860346501386049563360
97152574090090600606435183040
10100145045210210210210450451001512512
11136575075450450630630225225150151397760
121820120120900900168168090090012012018203727360
132380185640170170040840803063060680680309409748480
1430602784603063060918918091891803063060278460306025067520

Generated b-files: A080951 (row sums) ?

Computed in your browser ?

Technical details
Node id
n-1faae3cb309663bf · revision 1 · JSON
Definition source
derived:veronese_section_2_0
Fingerprint
f6-4e15cddc85973b47

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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 ?

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:   5;
  2:  15,    15;
  3:  35,   105;
  4:  70,   420,    70;
  5: 126,  1260,   630;
  6: 210,  3150,  3150,   210;
  7: 330,  6930, 11550,  2310;
  8: 495, 13860, 34650, 13860,  495;
  9: 715, 25740, 90090, 60060, 6435;
%F Formula
The row polynomials satisfy ((1/2)*n^2-(1/2)*n)*P(n,x) = (n^2+3*n-4)*P(n-1,x) - ((1/2)*n^2+(7/2)*n+6-((1/2)*n^2+(7/2)*n+6)*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 5.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 5;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 + 3*n - 4)*P[n - 1, x] - ((1/2)*n^2 + (7/2)*n + 6 - ((1/2)*n^2 + (7/2)*n + 6)*x)*P[n - 2, x])/((1/2)*n^2 - (1/2)*n)]];
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] = 5; for(n = 2, N, my(i = n + 1); v[i] = ((n^2 + 3*n - 4)*v[i - 1] - ((1/2)*n^2 + (7/2)*n + 6 - ((1/2)*n^2 + (7/2)*n + 6)*x)*v[i - 2])/((1/2)*n^2 - (1/2)*n)); 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-8ba085c2fb60bb1b
  • 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-8ba085c2fb60bb1b
  • 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-8ba085c2fb60bb1b
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-8ba085c2fb60bb1b

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 (10)

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