basis-map coefficients of A026729, shifted → Veronese 2
palindromic γ-positive nonnegative coefficients only rational roots
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 0 | ||||||||
| 3 | 0 | 1 | 1 | ||||||
| 4 | 0 | ||||||||
| 5 | 0 | 0 | 1 | 1 | |||||
| 6 | 0 | ||||||||
| 7 | 0 | 0 | 0 | 1 | 1 | ||||
| 8 | 0 | ||||||||
| 9 | 0 | 0 | 0 | 0 | 1 | 1 | |||
| 10 | 0 | ||||||||
| 11 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | ||
| 12 | 0 | ||||||||
| 13 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | |
| 14 | 0 | ||||||||
| 15 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 |
Computed in your browser ?
Technical details
- Node id
n-f0ec60597e294bc2· revision 1 · JSON- Definition source
derived:veronese_section_2_0- Fingerprint
f6-1641c37dbfc60bc3
Observed on the stored rows ?
- Degrees: 0, -1, 1, -1, 2, -1, 3, -1, 4, -1, 5, -1, 6, -1, 7 (half affine: slope 1, intercept -1)
- 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 ℚ): yes
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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 0; 3: 0, 1; 4: 0; 5: 0, 0, 1; 6: 0; 7: 0, 0, 0, 1; 8: 0; 9: 0, 0, 0, 0, 1; 10: 0;
%F FormulaThe row polynomials satisfy P(n,x) = x*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 0.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 0;
P[n_, x_] := P[n, x] = Expand[x*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 0; for(n = 3, N, my(i = n); v[i] = x*v[i - 2]); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 1, 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-4623d54d3168fd99,e-8d17877e985ddf1e -
Coefficients of one sign. Every nonzero row, n >= 1: 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-4623d54d3168fd99,e-8d17877e985ddf1e -
Hadamard kernel (Malo). Rows P_n, n >= 1, 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-4623d54d3168fd99,e-8d17877e985ddf1e
Proof chains
2 incoming proof steps. 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-4623d54d3168fd99Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-070da67d980ebd97root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-91ba1ede5d434b70Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
-
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
-
veronese_section r=2, j=0, shift 0
e-8d17877e985ddf1eVeronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-6e85c0971e84e272root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-ad67990681a86223Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
-
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
Related sequences ?
Same fingerprint (16)
Equal up to content, sign, reversal and a small index shift.
- basis-map coefficients of A026729 → Veronese 2 (j=1)
- basis-map coefficients of A030528, shifted → Veronese 2 (j=1)
- A130123 → Veronese 2 (j=1)
- basis-map coefficients of A021012 → Veronese 2
- A023531 → D → Veronese 2 (j=1)
- A010054 → reverse → Veronese 2
- basis-map coefficients of A026729, shifted → Veronese 2 (j=1)
- A136572 → Veronese 2 (j=1)
- A010054 → reverse → Veronese 2 (j=1)
- A010054 → reverse → Veronese 2
- basis-map coefficients of A112227 → Veronese 2
- A130123 → Veronese 2
- A023531 → Veronese 2
- A136572 → Veronese 2
- A133080 → Veronese 2 (j=1)
- basis-map coefficients of A021012 → Veronese 2 (j=1)
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