A352880 → reverse → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(3 + 7\,n + 3\,n x + 5\,n^{2} + 10\,n^{2} x + n^{3} + 12\,n^{3} x + 6\,n^{4} x + n^{5} x\right)\,P_{n}(x) = \left(12 + 16\,n + 32\,n x + 6\,n x^{2} + 7\,n^{2} + 50\,n^{2} x + 31\,n^{2} x^{2} + n^{3} + 29\,n^{3} x + 38\,n^{3} x^{2} + 8\,n^{4} x + 18\,n^{4} x^{2} + n^{5} x + 3\,n^{5} x^{2}\right)\,P_{n-1}(x) + \left(6\,x - 6\,x^{3} + 7\,n x + 16\,n x^{2} - 23\,n x^{3} + 2\,n^{2} x + 24\,n^{2} x^{2} - 26\,n^{2} x^{3} + 12\,n^{3} x^{2} - 12\,n^{3} x^{3} + 2\,n^{4} x^{2} - 2\,n^{4} x^{3}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 8\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 8 | 8 | |||||||
| 1 | 18 | 24 | 42 | ||||||
| 2 | 32 | 128 | 48 | 208 | |||||
| 3 | 50 | 400 | 450 | 80 | 980 | ||||
| 4 | 72 | 960 | 2160 | 1152 | 120 | 4464 | |||
| 5 | 98 | 1960 | 7350 | 7840 | 2450 | 168 | 19866 | ||
| 6 | 128 | 3584 | 20160 | 35840 | 22400 | 4608 | 224 | 86944 | |
| 7 | 162 | 6048 | 47628 | 127008 | 132300 | 54432 | 7938 | 288 | 375804 |
Compute more
?
Technical details
- Node id
n-31c316014331006b· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-b29d29aac1e7588a
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: 18, 24; 2: 32, 128, 48; 3: 50, 400, 450, 80; 4: 72, 960, 2160, 1152, 120; 5: 98, 1960, 7350, 7840, 2450, 168; 6: 128, 3584, 20160, 35840, 22400, 4608, 224; 7: 162, 6048, 47628, 127008, 132300, 54432, 7938, 288; 8: 200, 9600, 100800, 376320, 588000, 403200, 117600, 12800, 360; 9: 242, 14520, 196020, 975744, 2134440, 2195424, 1067220, 232320, 19602, 440;
%F FormulaThe row polynomials satisfy (n^3+5*n^2+7*n+3+(n^5+6*n^4+12*n^3+10*n^2+3*n)*x)*P(n,x) = (n^3+7*n^2+16*n+12+(n^5+8*n^4+29*n^3+50*n^2+32*n)*x+(3*n^5+18*n^4+38*n^3+31*n^2+6*n)*x^2)*P(n-1,x) + ((2*n^2+7*n+6)*x+(2*n^4+12*n^3+24*n^2+16*n)*x^2-(2*n^4+12*n^3+26*n^2+23*n+6)*x^3)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 8.
%t MathematicaP[0, x_] := 8;
P[n_, x_] := P[n, x] = Expand[Together[((n^3 + 7*n^2 + 16*n + 12 + (n^5 + 8*n^4 + 29*n^3 + 50*n^2 + 32*n)*x + (3*n^5 + 18*n^4 + 38*n^3 + 31*n^2 + 6*n)*x^2)*P[n - 1, x] + ((2*n^2 + 7*n + 6)*x + (2*n^4 + 12*n^3 + 24*n^2 + 16*n)*x^2 - (2*n^4 + 12*n^3 + 26*n^2 + 23*n + 6)*x^3)*D[P[n - 1, x], x])/(n^3 + 5*n^2 + 7*n + 3 + (n^5 + 6*n^4 + 12*n^3 + 10*n^2 + 3*n)*x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 8; for(n = 1, N, my(i = n + 1); v[i] = ((n^3 + 7*n^2 + 16*n + 12 + (n^5 + 8*n^4 + 29*n^3 + 50*n^2 + 32*n)*x + (3*n^5 + 18*n^4 + 38*n^3 + 31*n^2 + 6*n)*x^2)*v[i - 1] + ((2*n^2 + 7*n + 6)*x + (2*n^4 + 12*n^3 + 24*n^2 + 16*n)*x^2 - (2*n^4 + 12*n^3 + 26*n^2 + 23*n + 6)*x^3)*deriv(v[i - 1], x))/(n^3 + 5*n^2 + 7*n + 3 + (n^5 + 6*n^4 + 12*n^3 + 10*n^2 + 3*n)*x)); 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 Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, 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 ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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.