A013611 → D+1
nonnegative coefficients only rational roots
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 5 | 4 | 9 | |||||||||||||
| 2 | 9 | 40 | 16 | 65 | ||||||||||||
| 3 | 13 | 108 | 240 | 64 | 425 | |||||||||||
| 4 | 17 | 208 | 864 | 1280 | 256 | 2625 | ||||||||||
| 5 | 21 | 340 | 2080 | 5760 | 6400 | 1024 | 15625 | |||||||||
| 6 | 25 | 504 | 4080 | 16640 | 34560 | 30720 | 4096 | 90625 | ||||||||
| 7 | 29 | 700 | 7056 | 38080 | 116480 | 193536 | 143360 | 16384 | 515625 | |||||||
| 8 | 33 | 928 | 11200 | 75264 | 304640 | 745472 | 1032192 | 655360 | 65536 | 2890625 | ||||||
| 9 | 37 | 1188 | 16704 | 134400 | 677376 | 2193408 | 4472832 | 5308416 | 2949120 | 262144 | 16015625 | |||||
| 10 | 41 | 1480 | 23760 | 222720 | 1344000 | 5419008 | 14622720 | 25559040 | 26542080 | 13107200 | 1048576 | 87890625 | ||||
| 11 | 45 | 1804 | 32560 | 348480 | 2449920 | 11827200 | 39739392 | 91914240 | 140574720 | 129761280 | 57671680 | 4194304 | 478515625 | |||
| 12 | 49 | 2160 | 43296 | 520960 | 4181760 | 23519232 | 94617600 | 272498688 | 551485440 | 749731840 | 622854144 | 251658240 | 16777216 | 2587890625 | ||
| 13 | 53 | 2548 | 56160 | 750464 | 6772480 | 43490304 | 203833344 | 702873600 | 1771241472 | 3186360320 | 3898605568 | 2944401408 | 1090519040 | 67108864 | 13916015625 | |
| 14 | 57 | 2968 | 71344 | 1048320 | 10506496 | 75851776 | 405909504 | 1630666752 | 4920115200 | 11021058048 | 17843617792 | 19847446528 | 13740539904 | 4697620480 | 268435456 | 74462890625 |
Generated b-files: A081040 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-bf9d0f008400b3c6· revision 1 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-236e6d52004bfa9f
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
OEIS matches ?
- A081040: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?
A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.
OEIS submission text ?
Fields to paste into an OEIS submission: the example %e, the formula
%F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows.
For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched;
the matched terms were compared with the published ones, which identifies the node with the entry on a
finite prefix, not for every n. The PARI/GP program is not machine-checked here.
The atlas's own rows: n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 5, 4; 2: 9, 40, 16; 3: 13, 108, 240, 64; 4: 17, 208, 864, 1280, 256; 5: 21, 340, 2080, 5760, 6400, 1024; 6: 25, 504, 4080, 16640, 34560, 30720, 4096; 7: 29, 700, 7056, 38080, 116480, 193536, 143360, 16384; 8: 33, 928, 11200, 75264, 304640, 745472, 1032192, 655360, 65536; 9: 37, 1188, 16704, 134400, 677376, 2193408, 4472832, 5308416, 2949120, 262144;
%F FormulaThe row polynomials satisfy (4*n-3+4*x)*P(n,x) = (4*n+1+(16*n+8)*x+16*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 + 1 + (16*n + 8)*x + 16*x^2)*P[n - 1, x])/(4*n - 3 + 4*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 + 1 + (16*n + 8)*x + 16*x^2)*v[i - 1])/(4*n - 3 + 4*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)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-5d20fd95bc57193f -
Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
All coefficients of each polynomial have the same sign (after x -> -x when alternating).derived from the cited steps by a stated theorem:
e-5d20fd95bc57193f -
Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.derived from the cited steps by a stated theorem:
e-5d20fd95bc57193f -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-5d20fd95bc57193f
Proof chains
1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
preserver_image derivative_polynomial, shift 0
e-5d20fd95bc57193fLaguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+4x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-f45969f98fa0cee8root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers periodic_product
e-36f1e280ef03dec1root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image reversal, shift 0
e-8a33d9f811421624Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-2d1c3ef96dc1c123root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-6e49a6f9dd41e218Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+4x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-f45969f98fa0cee8(expanded above) -
↵ parent_provers periodic_product
e-36f1e280ef03dec1(expanded above) -
basis_map A013611
e-c19dc1e19e56bc04Geometric basis map (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
veronese_section r=2, j=0, shift 0
e-292206ad4ae86d2dVeronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?
-
premise (sequence):
basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-1991a148b9538b93root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-12303ad0e0b9f8ebAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
-
-
premise (sequence):
basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
-
parent_provers periodic_product
e-b7eca039219a7f53root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-7e44b66e04c497d6Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
preserver_image mobius, shift 0
e-db5094ba61234decAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+3*x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-035d18f235569c81root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A013610
e-404109e50a21afd4Geometric basis map (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
preserver_image reversal, shift 0
e-b03bb7746bf562deAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Cube of lower triangular normalized binomial matrix.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-2786234a932620b2root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-090c65763405a203Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+3*x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-035d18f235569c81(expanded above) -
↵ basis_map A013610
e-404109e50a21afd4(expanded above) -
parent_provers periodic_product
e-bd3566bc3465f71broot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-33c9dd76a325511aAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+2*x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-a6866143cc223753root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A013609
e-41b2234a78052e4fGeometric basis map (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
gamma_polynomial scale 1, shift 0
e-4c4f74d9ba733cffGamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-eab26daf7024ea74root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
-
preserver_image reversal, shift 0
e-6d15baf5e54583eeAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-0d085d05819c04f2root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-045f9d56b54ceaf2Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+2*x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-a6866143cc223753(expanded above) -
↵ basis_map A013609
e-41b2234a78052e4f(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-4c4f74d9ba733cff(expanded above) -
parent_provers periodic_product
e-d08b7f9df01d4f3croot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-2c323256b27180b8Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-317eb4ccca60c6acroot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-033cf842aad3bdf7Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-317eb4ccca60c6ac(expanded above) -
basis_map A007318
e-095baa2a9dfe188fGeometric basis map (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
parent_provers periodic_product
e-13983862a411779croot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image reversal, shift 0
e-989c95e5c893fce9Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Riordan array (1-x,x/(1-x)).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-b62074ba45057e82root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Riordan array (1-x,x/(1-x)).
-
gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3deaGamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image reversal, shift 0
e-0e058c428dfdfeb6Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-d82c9b48e4b31a6broot: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
-
↵ parent_provers periodic_product
e-d82c9b48e4b31a6b(expanded above)
-
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
-
preserver_image affine, shift 0
e-3a52de7742ed9314Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
↵ theorem_check liu_wang
-
premise (sequence):
binomial
-
↵ basis_map A007318
e-095baa2a9dfe188f(expanded above) -
↵ parent_provers periodic_product
e-13983862a411779c(expanded above) -
↵ preserver_image reversal, shift 0
e-989c95e5c893fce9(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3dea(expanded above) -
↵ preserver_image affine, shift 0
e-3a52de7742ed9314(expanded above)
-
-
premise (sequence):
binomial
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle of coefficients in expansion of (1+2*x)^n.
-
parent_provers periodic_product
e-1697ba43e31b7729root: theorem checkParent-row provers of polytool polytool ?
-
basis_map A007318
e-4608a916413bc814Geometric basis map (elementary) polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-317eb4ccca60c6ac(expanded above) -
↵ preserver_image reversal, shift 0
e-033cf842aad3bdf7(expanded above) -
↵ basis_map A007318
e-095baa2a9dfe188f(expanded above) -
↵ parent_provers periodic_product
e-13983862a411779c(expanded above) -
↵ preserver_image reversal, shift 0
e-989c95e5c893fce9(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3dea(expanded above) -
↵ preserver_image affine, shift 0
e-3a52de7742ed9314(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
binomial
-
preserver_image affine, shift 0
e-17c52917511dc051Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-317eb4ccca60c6ac(expanded above) -
↵ preserver_image reversal, shift 0
e-033cf842aad3bdf7(expanded above) -
↵ basis_map A007318
e-095baa2a9dfe188f(expanded above) -
↵ parent_provers periodic_product
e-13983862a411779c(expanded above) -
↵ preserver_image reversal, shift 0
e-989c95e5c893fce9(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3dea(expanded above) -
↵ preserver_image affine, shift 0
e-3a52de7742ed9314(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
binomial
-
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
-
↵ parent_provers periodic_product
e-d08b7f9df01d4f3c(expanded above) -
↵ preserver_image mobius, shift 0
e-2c323256b27180b8(expanded above)
-
-
premise (sequence):
Triangle of coefficients in expansion of (1+2*x)^n.
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle of coefficients in expansion of (1+3*x)^n.
-
parent_provers periodic_product
e-58678fea8a24dd74root: theorem checkParent-row provers of polytool polytool ?
-
basis_map A007318
e-7b97c40e19745577Geometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-0d085d05819c04f2(expanded above) -
↵ preserver_image reversal, shift 0
e-045f9d56b54ceaf2(expanded above) -
↵ parent_provers periodic_product
e-1697ba43e31b7729(expanded above) -
↵ basis_map A007318
e-4608a916413bc814(expanded above) -
↵ preserver_image affine, shift 0
e-17c52917511dc051(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
-
preserver_image affine, shift 0
e-4b09f87a5a93f62bAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-0d085d05819c04f2(expanded above) -
↵ preserver_image reversal, shift 0
e-045f9d56b54ceaf2(expanded above) -
↵ parent_provers periodic_product
e-1697ba43e31b7729(expanded above) -
↵ basis_map A007318
e-4608a916413bc814(expanded above) -
↵ preserver_image affine, shift 0
e-17c52917511dc051(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
-
-
premise (sequence):
Cube of lower triangular normalized binomial matrix.
-
↵ parent_provers periodic_product
e-bd3566bc3465f71b(expanded above) -
↵ preserver_image mobius, shift 0
e-33c9dd76a325511a(expanded above)
-
-
premise (sequence):
Triangle of coefficients in expansion of (1+3*x)^n.
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle of coefficients in expansion of (1+4x)^n.
-
basis_map A007318
e-9f0b70d11cb8d495Geometric basis map (elementary) polytool ?
-
premise (sequence):
Cube of lower triangular normalized binomial matrix.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-2786234a932620b2(expanded above) -
↵ preserver_image reversal, shift 0
e-090c65763405a203(expanded above) -
↵ parent_provers periodic_product
e-58678fea8a24dd74(expanded above) -
↵ basis_map A007318
e-7b97c40e19745577(expanded above) -
↵ preserver_image affine, shift 0
e-4b09f87a5a93f62b(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
Cube of lower triangular normalized binomial matrix.
-
parent_provers periodic_product
e-bf59fe80a0559f3eroot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image affine, shift 0
e-4db64ce997502606Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Cube of lower triangular normalized binomial matrix.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-2786234a932620b2(expanded above) -
↵ preserver_image reversal, shift 0
e-090c65763405a203(expanded above) -
↵ parent_provers periodic_product
e-58678fea8a24dd74(expanded above) -
↵ basis_map A007318
e-7b97c40e19745577(expanded above) -
↵ preserver_image affine, shift 0
e-4b09f87a5a93f62b(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
Cube of lower triangular normalized binomial matrix.
-
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j).
-
↵ basis_map A013611
e-c19dc1e19e56bc04(expanded above) -
↵ preserver_image mobius, shift 0
e-db5094ba61234dec(expanded above)
-
-
premise (sequence):
Triangle of coefficients in expansion of (1+4x)^n.
Related sequences ?
No candidate equalities or related sequences.
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
- [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.