A132393 → Veronese 2 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-3 + x + 4\,n - n^{2}\right)\,P_{n-2}(x) + \left(-3 + 2\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 0\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 0 | ||||||||
| 2 | 1 | 1 | 2 | ||||||
| 3 | 3 | 3 | 6 | ||||||
| 4 | 12 | 13 | 1 | 26 | |||||
| 5 | 60 | 70 | 10 | 140 | |||||
| 6 | 360 | 447 | 88 | 1 | 896 | ||||
| 7 | 2520 | 3297 | 798 | 21 | 6636 | ||||
| 8 | 20160 | 27576 | 7741 | 326 | 1 | 55804 | |||
| 9 | 181440 | 257904 | 81108 | 4680 | 36 | 525168 | |||
| 10 | 1814400 | 2667240 | 918729 | 66763 | 875 | 1 | 5468008 | ||
| 11 | 19958400 | 30226680 | 11225115 | 975205 | 18425 | 55 | 62403880 | ||
| 12 | 239500800 | 372517920 | 147440484 | 14788497 | 367063 | 1931 | 1 | 774616696 | |
| 13 | 3113510400 | 4960668960 | 2074344012 | 234335946 | 7206654 | 56238 | 78 | 10390122288 | |
| 14 | 43589145600 | 70986162240 | 31147129008 | 3891084063 | 142464838 | 1496880 | 3738 | 1 | 149757486368 |
Compute more
?
Technical details
- Node id
n-21b1aa2838132878· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-7b67c5ed25405f7a
Observed on the stored rows ?
- Degrees: 0, -1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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: 1; 1: 0; 2: 1, 1; 3: 3, 3; 4: 12, 13, 1; 5: 60, 70, 10; 6: 360, 447, 88, 1; 7: 2520, 3297, 798, 21; 8: 20160, 27576, 7741, 326, 1; 9: 181440, 257904, 81108, 4680, 36;
%F FormulaThe row polynomials satisfy P(n,x) = -(n^2-4*n+3-x)*P(n-2,x) + (2*n-3)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 0.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 0;
P[n_, x_] := P[n, x] = Expand[-(n^2 - 4*n + 3 - x)*P[n - 2, x] + (2*n - 3)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 0; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 - 4*n + 3 - x)*v[i - 2] + (2*n - 3)*v[i - 1]); 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]
- 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 ›
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.