basis-map coefficients of A113214, shifted → Veronese 2 (j=1) → basis A013611
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(4\,x\right)\,P_{n-2}(x) + \left(-2\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = -1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | -1 | -1 | ||||||
| 2 | 2 | 2 | ||||||
| 3 | -4 | -4 | -8 | |||||
| 4 | 8 | 16 | 24 | |||||
| 5 | -16 | -48 | -16 | -80 | ||||
| 6 | 32 | 128 | 96 | 256 | ||||
| 7 | -64 | -320 | -384 | -64 | -832 | |||
| 8 | 128 | 768 | 1280 | 512 | 2688 | |||
| 9 | -256 | -1792 | -3840 | -2560 | -256 | -8704 | ||
| 10 | 512 | 4096 | 10752 | 10240 | 2560 | 28160 | ||
| 11 | -1024 | -9216 | -28672 | -35840 | -15360 | -1024 | -91136 | |
| 12 | 2048 | 20480 | 73728 | 114688 | 71680 | 12288 | 294912 | |
| 13 | -4096 | -45056 | -184320 | -344064 | -286720 | -86016 | -4096 | -954368 |
| 14 | 8192 | 98304 | 450560 | 983040 | 1032192 | 458752 | 57344 | 3088384 |
Compute more
?
Technical details
- Node id
n-d78f99cf1ffbcb41· revision 0 · JSON- Definition source
derived:basis_map_A013611- Fingerprint
f6-8de4b75c4559d58b
Observed on the stored rows ?
- Degrees: -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6 (half affine: slope 1, intercept -1)
- Palindromic rows: no
- γ-positive (gamma_positive): no
- Nonnegative coefficients (
nonn): no - Only rational roots (
rr_by_factors: every nonzero row is a product of linear factors over ℚ): no
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 0; 1: -1; 2: 2; 3: -4, -4; 4: 8, 16; 5: -16, -48, -16; 6: 32, 128, 96; 7: -64, -320, -384, -64; 8: 128, 768, 1280, 512; 9: -256, -1792, -3840, -2560, -256;
%F FormulaThe row polynomials satisfy P(n,x) = 4*x*P(n-2,x) - 2*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = -1.
%t MathematicaP[0, x_] := 0;
P[1, x_] := -1;
P[n_, x_] := P[n, x] = Expand[4*x*P[n - 2, x] - 2*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = -1; for(n = 2, N, my(i = n + 1); v[i] = 4*x*v[i - 2] - 2*v[i - 1]); 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)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
veronese_section_2_1 of basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0?
-
Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ? step ›
-
from
basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0?
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0?
-
-
from
veronese_section_2_1 of basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0?
Related ?
Same fingerprint ?
- A034867 → basis A013611
- A113214 → θ+1 → reverse
- A169803: Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).
- A026729: Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
- A113214 → θ+1
- A178822 → Veronese 2 (j=1) → basis A013611
- A178821 → Veronese 2 (j=1) → basis A013611
- A028326 → Veronese 2 (j=1) → basis A013611
- A034807 → D
- A038208 → Veronese 2 (j=1) → basis A013611
- reversed rows → D
- A030528: Triangle read by rows: T(n,k) = binomial(k,n-k).
- A052553: Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.
- A011973: Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of …
- A178820 → Veronese 2 (j=1) → basis A013611
- A007318 → Veronese 2 (j=1) → basis A013611
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
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [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
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.