A352880 → reverse → basis A013609
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(24\,x^{2} + 28\,n x^{2} - 16\,n^{2} x^{2} - 28\,n^{3} x^{2} - 8\,n^{4} x^{2}\right)\,P_{n-2}(x) + \left(12\,n + 38\,n^{2} + 32\,n^{2} x + 32\,n^{3} + 32\,n^{3} x + 8\,n^{4} + 8\,n^{4} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 8\)
\(P_{1}(x) = 30 + 24\,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 | 24 | 54 | |||||||||||||
| 2 | 112 | 192 | 64 | 368 | ||||||||||||
| 3 | 420 | 1120 | 840 | 160 | 2540 | |||||||||||
| 4 | 1584 | 5760 | 6912 | 3072 | 384 | 17712 | ||||||||||
| 5 | 6006 | 27720 | 46200 | 33600 | 10080 | 896 | 124502 | |||||||||
| 6 | 22880 | 128128 | 274560 | 281600 | 140800 | 30720 | 2048 | 880736 | ||||||||
| 7 | 87516 | 576576 | 1513512 | 2018016 | 1441440 | 532224 | 88704 | 4608 | 6262596 | |||||||
| 8 | 335920 | 2545920 | 7920640 | 13045760 | 12230400 | 6522880 | 1863680 | 245760 | 10240 | 44721200 | ||||||
| 9 | 1293292 | 11085360 | 39907296 | 78414336 | 91483392 | 64576512 | 26906880 | 6150144 | 658944 | 22528 | 320498684 | |||||
| 10 | 4992288 | 47752320 | 195350400 | 446515200 | 625121280 | 552738816 | 307077120 | 103219200 | 19353600 | 1720320 | 49152 | 2303889696 | ||||
| 11 | 19315400 | 203970624 | 934865360 | 2438779200 | 3990729600 | 4256778240 | 2979744768 | 1344245760 | 373401600 | 58572800 | 4392960 | 106496 | 16604902808 | |||
| 12 | 74884320 | 865329920 | 4393213440 | 12886759424 | 24162673920 | 30255869952 | 25671647232 | 14669512704 | 5501067264 | 1286799360 | 171573248 | 11010048 | 229376 | 119950570208 | ||
| 13 | 290845350 | 3650610600 | 20339116200 | 66290452800 | 140229804000 | 201930917760 | 201930917760 | 140473681920 | 67044257280 | 21283891200 | 4256778240 | 488816640 | 27156480 | 491520 | 868237737750 | |
| 14 | 1131445440 | 15329260800 | 92997515520 | 333508331520 | 786126781440 | 1281095495680 | 1478187110400 | 1216336822272 | 709529812992 | 287925141504 | 78525038592 | 13597409280 | 1359740928 | 66060288 | 1048576 | 6295717015232 |
Compute more
?
Technical details
- Node id
n-255ef16c4f62b1af· revision 0 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-3ac782335c346aee
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, 24; 2: 112, 192, 64; 3: 420, 1120, 840, 160; 4: 1584, 5760, 6912, 3072, 384; 5: 6006, 27720, 46200, 33600, 10080, 896; 6: 22880, 128128, 274560, 281600, 140800, 30720, 2048; 7: 87516, 576576, 1513512, 2018016, 1441440, 532224, 88704, 4608; 8: 335920, 2545920, 7920640, 13045760, 12230400, 6522880, 1863680, 245760, 10240; 9: 1293292, 11085360, 39907296, 78414336, 91483392, 64576512, 26906880, 6150144, 658944, 22528;
%F FormulaThe row polynomials satisfy (2*n^4+9*n^3+10*n^2+3*n)*P(n,x) = -(8*n^4+28*n^3+16*n^2-28*n-24)*x^2*P(n-2,x) + (8*n^4+32*n^3+38*n^2+12*n+(8*n^4+32*n^3+32*n^2)*x)*P(n-1,x) for n >= 2, with P(0,x) = 8, P(1,x) = 30 + 24*x.
%t MathematicaP[0, x_] := 8;
P[1, x_] := 30 + 24*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(8*n^4 + 28*n^3 + 16*n^2 - 28*n - 24)*x^2*P[n - 2, x] + (8*n^4 + 32*n^3 + 38*n^2 + 12*n + (8*n^4 + 32*n^3 + 32*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 + 24*x; for(n = 2, N, my(i = n + 1); v[i] = (-(8*n^4 + 28*n^3 + 16*n^2 - 28*n - 24)*x^2*v[i - 2] + (8*n^4 + 32*n^3 + 38*n^2 + 12*n + (8*n^4 + 32*n^3 + 32*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.