A352880 → reverse → basis A013610
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(3\,n + 10\,n^{2} + 9\,n^{3} + 2\,n^{4}\right)\,P_{n}(x) = \left(54\,x^{2} + 63\,n x^{2} - 36\,n^{2} x^{2} - 63\,n^{3} x^{2} - 18\,n^{4} x^{2}\right)\,P_{n-2}(x) + \left(12\,n + 38\,n^{2} + 48\,n^{2} x + 32\,n^{3} + 48\,n^{3} x + 8\,n^{4} + 12\,n^{4} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 8\)
\(P_{1}(x) = 30 + 36\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 8 | 8 | ||||||||||||||
| 1 | 30 | 36 | 66 | |||||||||||||
| 2 | 112 | 288 | 144 | 544 | ||||||||||||
| 3 | 420 | 1680 | 1890 | 540 | 4530 | |||||||||||
| 4 | 1584 | 8640 | 15552 | 10368 | 1944 | 38088 | ||||||||||
| 5 | 6006 | 41580 | 103950 | 113400 | 51030 | 6804 | 322770 | |||||||||
| 6 | 22880 | 192192 | 617760 | 950400 | 712800 | 233280 | 23328 | 2752640 | ||||||||
| 7 | 87516 | 864864 | 3405402 | 6810804 | 7297290 | 4041576 | 1010394 | 78732 | 23596578 | |||||||
| 8 | 335920 | 3818880 | 17821440 | 44029440 | 61916400 | 49533120 | 21228480 | 4199040 | 262440 | 203145160 | ||||||
| 9 | 1293292 | 16628040 | 89791416 | 264648384 | 463134672 | 490377888 | 306486180 | 105080976 | 16888014 | 866052 | 1755194914 | |||||
| 10 | 4992288 | 71628480 | 439538400 | 1506988800 | 3164676480 | 4197360384 | 3497800320 | 1763596800 | 496011600 | 66134880 | 2834352 | 15211562784 | ||||
| 11 | 19315400 | 305955936 | 2103447060 | 8230879800 | 20203068600 | 32324909760 | 33941155248 | 22967699040 | 9569874600 | 2251735200 | 253320210 | 9211644 | 132180572498 | |||
| 12 | 74884320 | 1297994880 | 9884730240 | 43492813056 | 122323536720 | 229755512448 | 292416106752 | 250642377216 | 140986337184 | 49468890240 | 9893778048 | 952342272 | 29760696 | 1151219064072 | ||
| 13 | 290845350 | 5475915900 | 45763011450 | 223730278200 | 709913382750 | 1533412906740 | 2300119360110 | 2400124549680 | 1718270984430 | 818224278300 | 245467283490 | 42281445960 | 3523453830 | 95659380 | 10046693355570 | |
| 14 | 1131445440 | 22993891200 | 209244409920 | 1125590618880 | 3979766831040 | 9728318920320 | 16837475054400 | 20782254924288 | 18184473058752 | 11068809687936 | 4528149417792 | 1176142705920 | 176421405888 | 12856620672 | 306110016 | 87833935102464 |
Compute more
?
Technical details
- Node id
n-c0d268b8d0600f93· revision 0 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-dae6101d606a19f7
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 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
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 8; 1: 30, 36; 2: 112, 288, 144; 3: 420, 1680, 1890, 540; 4: 1584, 8640, 15552, 10368, 1944; 5: 6006, 41580, 103950, 113400, 51030, 6804; 6: 22880, 192192, 617760, 950400, 712800, 233280, 23328; 7: 87516, 864864, 3405402, 6810804, 7297290, 4041576, 1010394, 78732; 8: 335920, 3818880, 17821440, 44029440, 61916400, 49533120, 21228480, 4199040, 262440; 9: 1293292, 16628040, 89791416, 264648384, 463134672, 490377888, 306486180, 105080976, 16888014, 866052;
%F FormulaThe row polynomials satisfy (2*n^4+9*n^3+10*n^2+3*n)*P(n,x) = -(18*n^4+63*n^3+36*n^2-63*n-54)*x^2*P(n-2,x) + (8*n^4+32*n^3+38*n^2+12*n+(12*n^4+48*n^3+48*n^2)*x)*P(n-1,x) for n >= 2, with P(0,x) = 8, P(1,x) = 30 + 36*x.
%t MathematicaP[0, x_] := 8;
P[1, x_] := 30 + 36*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(18*n^4 + 63*n^3 + 36*n^2 - 63*n - 54)*x^2*P[n - 2, x] + (8*n^4 + 32*n^3 + 38*n^2 + 12*n + (12*n^4 + 48*n^3 + 48*n^2)*x)*P[n - 1, x])/(2*n^4 + 9*n^3 + 10*n^2 + 3*n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 8; v[2] = 30 + 36*x; for(n = 2, N, my(i = n + 1); v[i] = (-(18*n^4 + 63*n^3 + 36*n^2 - 63*n - 54)*x^2*v[i - 2] + (8*n^4 + 32*n^3 + 38*n^2 + 12*n + (12*n^4 + 48*n^3 + 48*n^2)*x)*v[i - 1])/(2*n^4 + 9*n^3 + 10*n^2 + 3*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)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 ≥ 1
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
-
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
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1-x,x/(1-x)).?
-
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
Riordan array (1-x,x/(1-x)).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
binomial?
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
-
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
Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
-
-
from
reversal of Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
Related ?
Same fingerprint ?
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
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.