A347823 → reverse → x ↦ x/(x+1)
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 - 3\,x - 3\,x^{2} - x^{3} + 2\,n + 6\,n x + 6\,n x^{2} + 2\,n x^{3}\right)\,P_{n}(x) = \left(1 - 12\,x^{2} - 26\,x^{3} - 21\,x^{4} - 6\,x^{5} + 2\,n + 14\,n x + 36\,n x^{2} + 44\,n x^{3} + 26\,n x^{4} + 6\,n x^{5}\right)\,P_{n-1}(x) + \left(-2\,x - 13\,x^{2} - 33\,x^{3} - 41\,x^{4} - 25\,x^{5} - 6\,x^{6}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 3 | 5 | 8 | ||||||
| 2 | 5 | 18 | 16 | 39 | |||||
| 3 | 7 | 39 | 72 | 44 | 162 | ||||
| 4 | 9 | 68 | 192 | 240 | 112 | 621 | |||
| 5 | 11 | 105 | 400 | 760 | 720 | 272 | 2268 | ||
| 6 | 13 | 150 | 720 | 1840 | 2640 | 2016 | 640 | 8019 | |
| 7 | 15 | 203 | 1176 | 3780 | 7280 | 8400 | 5376 | 1472 | 27702 |
Compute more
?
Technical details
- Node id
n-c1e56615ee6819d6· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-67d96af909b5ec1e
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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 3, 5; 2: 5, 18, 16; 3: 7, 39, 72, 44; 4: 9, 68, 192, 240, 112; 5: 11, 105, 400, 760, 720, 272; 6: 13, 150, 720, 1840, 2640, 2016, 640; 7: 15, 203, 1176, 3780, 7280, 8400, 5376, 1472; 8: 17, 264, 1792, 6944, 16800, 25984, 25088, 13824, 3328; 9: 19, 333, 2592, 11760, 34272, 66528, 86016, 71424, 34560, 7424;
%F FormulaThe row polynomials satisfy (2*n-1+(6*n-3)*x+(6*n-3)*x^2+(2*n-1)*x^3)*P(n,x) = (2*n+1+14*n*x+(36*n-12)*x^2+(44*n-26)*x^3+(26*n-21)*x^4+(6*n-6)*x^5)*P(n-1,x) - (2*x+13*x^2+33*x^3+41*x^4+25*x^5+6*x^6)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((2*n + 1 + 14*n*x + (36*n - 12)*x^2 + (44*n - 26)*x^3 + (26*n - 21)*x^4 + (6*n - 6)*x^5)*P[n - 1, x] - (2*x + 13*x^2 + 33*x^3 + 41*x^4 + 25*x^5 + 6*x^6)*D[P[n - 1, x], x])/(2*n - 1 + (6*n - 3)*x + (6*n - 3)*x^2 + (2*n - 1)*x^3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((2*n + 1 + 14*n*x + (36*n - 12)*x^2 + (44*n - 26)*x^3 + (26*n - 21)*x^4 + (6*n - 6)*x^5)*v[i - 1] - (2*x + 13*x^2 + 33*x^3 + 41*x^4 + 25*x^5 + 6*x^6)*deriv(v[i - 1], x))/(2*n - 1 + (6*n - 3)*x + (6*n - 3)*x^2 + (2*n - 1)*x^3)); 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 [-1, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n.?
-
Laguerre’s 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?
-
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) = (n+k+1)*binomial(n,k), 0 <= k <= n.?
-
-
from
reversal of Triangle read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n.?
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.