A135065 → x ↦ x+1 → θ+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(2\,n^{2} + n^{3} x\right)\,P_{n}(x) = \left(4 + 4\,x + x^{2} + 8\,n + 10\,n x + 3\,n x^{2} + 4\,n^{2} + 8\,n^{2} x + 3\,n^{2} x^{2} + 2\,n^{3} x + n^{3} x^{2}\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 | 8 | 8 | 16 | ||||||
| 2 | 36 | 72 | 27 | 135 | |||||
| 3 | 128 | 384 | 288 | 64 | 864 | ||||
| 4 | 400 | 1600 | 1800 | 800 | 125 | 4725 | |||
| 5 | 1152 | 5760 | 8640 | 5760 | 1800 | 216 | 23328 | ||
| 6 | 3136 | 18816 | 35280 | 31360 | 14700 | 3528 | 343 | 107163 | |
| 7 | 8192 | 57344 | 129024 | 143360 | 89600 | 32256 | 6272 | 512 | 466560 |
Compute more
?
Technical details
- Node id
n-ba747c7b819ac5dd· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-e620d4a356abb37c
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: 8, 8; 2: 36, 72, 27; 3: 128, 384, 288, 64; 4: 400, 1600, 1800, 800, 125; 5: 1152, 5760, 8640, 5760, 1800, 216; 6: 3136, 18816, 35280, 31360, 14700, 3528, 343; 7: 8192, 57344, 129024, 143360, 89600, 32256, 6272, 512; 8: 20736, 165888, 435456, 580608, 453600, 217728, 63504, 10368, 729; 9: 51200, 460800, 1382400, 2150400, 2016000, 1209600, 470400, 115200, 16200, 1000;
%F FormulaThe row polynomials satisfy (2*n^2+n^3*x)*P(n,x) = (4*n^2+8*n+4+(2*n^3+8*n^2+10*n+4)*x+(n^3+3*n^2+3*n+1)*x^2)*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[((4*n^2 + 8*n + 4 + (2*n^3 + 8*n^2 + 10*n + 4)*x + (n^3 + 3*n^2 + 3*n + 1)*x^2)*P[n - 1, x])/(2*n^2 + n^3*x)]];
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] = ((4*n^2 + 8*n + 4 + (2*n^3 + 8*n^2 + 10*n + 4)*x + (n^3 + 3*n^2 + 3*n + 1)*x^2)*v[i - 1])/(2*n^2 + n^3*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
shift_x_plus_one of A127733 * A007318 as infinite lower triangular matrices.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
A127733 * A007318 as infinite lower triangular matrices.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
A127733 * A007318 as infinite lower triangular matrices.?
-
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?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
A127733 * A007318 as infinite lower triangular matrices.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Even-numbered rows of Pascal's triangle.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Even-numbered rows of Pascal's triangle.?
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (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
Even-numbered rows of Pascal's triangle.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Even-numbered rows of Pascal's triangle.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ 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?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Iterated real-rootedness preservers (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Iterated real-rootedness preservers (above)
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Veronese sections of Pólya frequency sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Veronese sections of Pólya frequency sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Gamma criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Veronese sections of Pólya frequency sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Veronese sections of Pólya frequency sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Ray basis map theorem (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Veronese sections of Pólya frequency sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
-
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
A127733 * A007318 as infinite lower triangular matrices.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
A127733 * A007318 as infinite lower triangular matrices.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
A127733 * A007318 as infinite lower triangular matrices.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
A127733 * A007318 as infinite lower triangular matrices.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
A127733 * A007318 as infinite lower triangular matrices.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
A127733 * A007318 as infinite lower triangular matrices.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
A127733 * A007318 as infinite lower triangular matrices.?
-
-
from
shift_x_plus_one of A127733 * A007318 as infinite lower triangular matrices.?
Related ?
Same fingerprint ?
- A027466 → basis A013611 → θ+1
- A028326 → basis A007318 → θ+1
- A356546 → x ↦ x+1 → θ+1
- A094305 → x ↦ x+1 → θ+1
- A038208 → basis A007318 → θ+1
- A038221 → x ↦ x+1 → θ+1
- A131431 → D+1 → basis A013609
- A085880 → x ↦ x+1 → θ+1
- A038207 → θ+1
- A196347 → x ↦ x+1 → θ+1
- A178821 → basis A007318 → θ+1
- A038325 → basis A007318 → θ+1
- A178820 → basis A007318 → θ+1
- A038330 → basis A013609 → θ+1
- A156992 → basis A007318 → θ+1
- A132440 → D+1 → basis A013609
- A085881 → basis A007318 → θ+1
- image under θ+1 → θ+1 → D+1 → basis A013609
- A120910 → θ+1
- A178822 → x ↦ x+1 → θ+1
- A120910 → D → θ+1
- basis-map coefficients of A113214, shifted → x ↦ x+1 → θ+1
- A003506 → x ↦ x+1 → θ+1
- A038338 → x ↦ x+1 → θ+1
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
- [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.