basis-map coefficients of A026729 → basis A013611 → θ+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 - 4\,x + 4\,n x\right)\,P_{n}(x) = \left(1 + 4\,x + 4\,n x + 16\,n x^{2}\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 1 | 8 | 9 | ||||||
| 3 | 1 | 16 | 48 | 65 | |||||
| 4 | 1 | 24 | 144 | 256 | 425 | ||||
| 5 | 1 | 32 | 288 | 1024 | 1280 | 2625 | |||
| 6 | 1 | 40 | 480 | 2560 | 6400 | 6144 | 15625 | ||
| 7 | 1 | 48 | 720 | 5120 | 19200 | 36864 | 28672 | 90625 | |
| 8 | 1 | 56 | 1008 | 8960 | 44800 | 129024 | 200704 | 131072 | 515625 |
Compute more
?
Technical details
- Node id
n-20406d92a36f9204· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-14ef8ed0e797c5a3
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 -1)
- 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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 1, 8; 3: 1, 16, 48; 4: 1, 24, 144, 256; 5: 1, 32, 288, 1024, 1280; 6: 1, 40, 480, 2560, 6400, 6144; 7: 1, 48, 720, 5120, 19200, 36864, 28672; 8: 1, 56, 1008, 8960, 44800, 129024, 200704, 131072; 9: 1, 64, 1344, 14336, 89600, 344064, 802816, 1048576, 589824; 10: 1, 72, 1728, 21504, 161280, 774144, 2408448, 4718592, 5308416, 2621440;
%F FormulaThe row polynomials satisfy (1+(4*n-4)*x)*P(n,x) = (1+(4*n+4)*x+16*n*x^2)*P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((1 + (4*n + 4)*x + 16*n*x^2)*P[n - 1, x])/(1 + (4*n - 4)*x)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((1 + (4*n + 4)*x + 16*n*x^2)*v[i - 1])/(1 + (4*n - 4)*x)); 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)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A013611 of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k …?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013610 of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k …?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013609 of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k …?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
from
basis_map_A013609 of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k …?
-
from
basis_map_A013610 of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k …?
-
-
from
basis_map_A013611 of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k …?
Related ?
Same fingerprint ?
- A130123 → basis A013611 → θ+1
- basis-map coefficients of A112227 → basis A013611 → θ+1
- A013611 → θ+1
- A136572 → basis A013611 → θ+1
- A013611 → D → θ+1
References
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.