A099040 → Veronese 2

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(4\,x\right)\,P_{n-2}(x) + \left(8\,x\right)\,P_{n-3}(x) + \left(4\,x\right)\,P_{n-4}(x)\)

\(P_{0}(x) = 1\)

\(P_{1}(x) = 0\)

\(P_{2}(x) = 4\,x\)

\(P_{3}(x) = 8\,x\)

Rows ?

n	x⁰	x¹	x²	x³	P_n(1)
0	1				1
1					0
2	0	4			4
3	0	8			8
4	0	4	16		20
5	0	0	64		64
6	0	0	96	64	160
7	0	0	64	384	448

Show all 15 stored rows

Computed in your browser ?

Technical details

Node id: n-3454f35390d57b05 · revision 1 · JSON
Definition source: derived:veronese_section_2_0
Fingerprint: f6-09159489a3fc41c2

Observed on the stored rows ?

Degrees: 0, -1, 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 ?

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: 0;
  2: 0, 4;
  3: 0, 8;
  4: 0, 4, 16;
  5: 0, 0, 64;
  6: 0, 0, 96,   64;
  7: 0, 0, 64,  384;
  8: 0, 0, 16,  960,  256;
  9: 0, 0,  0, 1280, 2048;

%F Formula

The row polynomials satisfy P(n,x) = 4*x*P(n-2,x) + 8*x*P(n-3,x) + 4*x*P(n-4,x) for n >= 4, with P(0,x) = 1, P(1,x) = 0, P(2,x) = 4*x, P(3,x) = 8*x.

%t Mathematica

P[0, x_] := 1;
P[1, x_] := 0;
P[2, x_] := 4*x;
P[3, x_] := 8*x;
P[n_, x_] := P[n, x] = Expand[4*x*P[n - 2, x] + 8*x*P[n - 3, x] + 4*x*P[n - 4, 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] = 0; v[3] = 4*x; v[4] = 8*x; for(n = 4, N, my(i = n + 1); v[i] = 4*x*v[i - 2] + 8*x*v[i - 3] + 4*x*v[i - 4]); 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-07e54b52255e06bd
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-07e54b52255e06bd
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-07e54b52255e06bd

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

veronese_section r=2, j=0, shift 0 e-07e54b52255e06bd

Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?
- premise (sequence): Riordan array (1, 2+2x).
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
  - basis_map A099040 e-52040eb0dce100d3
    
    Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
    
    premise (sequence): a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [0, 0]
    
    no recorded property covers this requirement
  - theorem_check ma_wang_interval e-17786677d2ed021b root: theorem check
    
    Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ?
  - basis_map A027467 e-0a457ba83443136e
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): basis-map coefficients of Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 15]
    
    preserver_image affine, shift 0 e-48e4dfa7d694f880
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0]
    
    ↵ theorem_check ma_wang_interval e-17786677d2ed021b (expanded above)
  - basis_map A038255 e-162624a94908f408
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): basis-map coefficients of Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 6]
    
    preserver_image affine, shift 0 e-79e1a4a5e521405c
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0]
    
    ↵ theorem_check ma_wang_interval e-17786677d2ed021b (expanded above)
  - basis_map A027466 e-3f03a2606d2e6662
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): basis-map coefficients of Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 7]
    
    preserver_image affine, shift 0 e-5e00209341210844
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0]
    
    ↵ theorem_check ma_wang_interval e-17786677d2ed021b (expanded above)
  - basis_map A038303 e-532ccda39f04a0f0
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): basis-map coefficients of Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 10]
    
    preserver_image affine, shift 0 e-c2f106499058af8f
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0]
    
    ↵ theorem_check ma_wang_interval e-17786677d2ed021b (expanded above)
  - basis_map A038207 e-72107609b2d5e6bc
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): basis-map coefficients of Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 2]
    
    preserver_image affine, shift 0 e-8c4e4f825f4ab306
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0]
    
    ↵ theorem_check ma_wang_interval e-17786677d2ed021b (expanded above)
  - basis_map A038243 e-763de8a298cf812d
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): basis-map coefficients of Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 5]
    
    preserver_image affine, shift 0 e-bdc3e5aca0457f81
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0]
    
    ↵ theorem_check ma_wang_interval e-17786677d2ed021b (expanded above)
  - basis_map A038279 e-8232f658d776d13c
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): basis-map coefficients of Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 8]
    
    preserver_image affine, shift 0 e-4478346993b2c814
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0]
    
    ↵ theorem_check ma_wang_interval e-17786677d2ed021b (expanded above)
  - basis_map A027465 e-af79ef336fd9f8da
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): basis-map coefficients of Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 3]
    
    preserver_image affine, shift 0 e-319b2a76ea6c1ab0
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0]
    
    ↵ theorem_check ma_wang_interval e-17786677d2ed021b (expanded above)
  - basis_map A038291 e-c3d762863d6658d7
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): basis-map coefficients of Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 9]
    
    preserver_image affine, shift 0 e-b9371054cfe1d371
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0]
    
    ↵ theorem_check ma_wang_interval e-17786677d2ed021b (expanded above)
  - basis_map A007318 e-e158703ce212fb71
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): basis-map coefficients of Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 1]
    
    preserver_image affine, shift 0 e-dc7a132d665751c2
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0]
    
    ↵ theorem_check ma_wang_interval e-17786677d2ed021b (expanded above)
  - basis_map A038231 e-e36b44dfb8fba667
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): basis-map coefficients of Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 4]
    
    preserver_image affine, shift 0 e-23d8b9b067cbe12f
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0]
    
    ↵ theorem_check ma_wang_interval e-17786677d2ed021b (expanded above)
  - basis_map A038327 e-ffeb0648278e3cee
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): basis-map coefficients of Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 12]
    
    preserver_image affine, shift 0 e-1000187f132dd1ea
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1, 2+2x).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0]
    
    ↵ theorem_check ma_wang_interval e-17786677d2ed021b (expanded above)

Related sequences ?

No candidate equalities or related sequences.

References

[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
[AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
[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
[MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741