A144084 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 - 2\,n + n^{2}\right)\,P_{n}(x) = \left(n^{2} - 3\,n^{2} x + 2\,n^{3} x\right)\,P_{n-1}(x) + \left(-n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 1 | 1 | ||||||
| 2 | 4 | 4 | 8 | |||||
| 3 | 9 | 36 | 18 | 63 | ||||
| 4 | 16 | 144 | 288 | 96 | 544 | |||
| 5 | 25 | 400 | 1800 | 2400 | 600 | 5225 | ||
| 6 | 36 | 900 | 7200 | 21600 | 21600 | 4320 | 55656 | |
| 7 | 49 | 1764 | 22050 | 117600 | 264600 | 211680 | 35280 | 653023 |
Compute more
?
Technical details
- Node id
n-e5906904a5f133ef· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-f3c222c4860e5244
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (affine: slope 1, intercept -1)
- 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: 0; 1: 1; 2: 4, 4; 3: 9, 36, 18; 4: 16, 144, 288, 96; 5: 25, 400, 1800, 2400, 600; 6: 36, 900, 7200, 21600, 21600, 4320; 7: 49, 1764, 22050, 117600, 264600, 211680, 35280; 8: 64, 3136, 56448, 470400, 1881600, 3386880, 2257920, 322560; 9: 81, 5184, 127008, 1524096, 9525600, 30481920, 45722880, 26127360, 3265920;
%F FormulaThe row polynomials satisfy (n^2-2*n+1)*P(n,x) = (n^2+(2*n^3-3*n^2)*x)*P(n-1,x) - n^2*x^2*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 1.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 + (2*n^3 - 3*n^2)*x)*P[n - 1, x] - n^2*x^2*D[P[n - 1, x], x])/(n^2 - 2*n + 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((n^2 + (2*n^3 - 3*n^2)*x)*v[i - 1] - n^2*x^2*deriv(v[i - 1], x))/(n^2 - 2*n + 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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.?
-
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
basis_map_A008277 of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 …?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
-
from
basis_map_A008277 of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 …?
- ↑ Iterated real-rootedness preservers (above)
-
-
from
T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.?
Related ?
Same fingerprint ?
- A144084: T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.
- A395972 → D
- A395972 → reverse
- Triangle read by rows: T(n, k) = 2^n * [x^k] hypergeom([-n, -n, 1], [1], x).
- A130534 → basis A008277 → θ+1
- A271703 → D
- A271703 → D+1
- A132393 → basis A008277
- A105278 → θ+1
References
- [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
- [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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.