A013611 → Pₙ + Pₙ₊₁
nonnegative coefficients only rational roots
Proved for all n: all roots real what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | x15 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 2 | 4 | 6 | ||||||||||||||
| 1 | 2 | 12 | 16 | 30 | |||||||||||||
| 2 | 2 | 20 | 64 | 64 | 150 | ||||||||||||
| 3 | 2 | 28 | 144 | 320 | 256 | 750 | |||||||||||
| 4 | 2 | 36 | 256 | 896 | 1536 | 1024 | 3750 | ||||||||||
| 5 | 2 | 44 | 400 | 1920 | 5120 | 7168 | 4096 | 18750 | |||||||||
| 6 | 2 | 52 | 576 | 3520 | 12800 | 27648 | 32768 | 16384 | 93750 | ||||||||
| 7 | 2 | 60 | 784 | 5824 | 26880 | 78848 | 143360 | 147456 | 65536 | 468750 | |||||||
| 8 | 2 | 68 | 1024 | 8960 | 50176 | 186368 | 458752 | 720896 | 655360 | 262144 | 2343750 | ||||||
| 9 | 2 | 76 | 1296 | 13056 | 86016 | 387072 | 1204224 | 2555904 | 3538944 | 2883584 | 1048576 | 11718750 | |||||
| 10 | 2 | 84 | 1600 | 18240 | 138240 | 731136 | 2752512 | 7372800 | 13762560 | 17039360 | 12582912 | 4194304 | 58593750 | ||||
| 11 | 2 | 92 | 1936 | 24640 | 211200 | 1284096 | 5677056 | 18382848 | 43253760 | 72089600 | 80740352 | 54525952 | 16777216 | 292968750 | |||
| 12 | 2 | 100 | 2304 | 32384 | 309760 | 2128896 | 10813440 | 41091072 | 116785152 | 245104640 | 369098752 | 377487360 | 234881024 | 67108864 | 1464843750 | ||
| 13 | 2 | 108 | 2704 | 41600 | 439296 | 3367936 | 19329024 | 84344832 | 281149440 | 712245248 | 1349517312 | 1853882368 | 1744830464 | 1006632960 | 268435456 | 7324218750 | |
| 14 | 2 | 116 | 3136 | 52416 | 605696 | 5125120 | 32800768 | 161660928 | 618528768 | 1836843008 | 4198498304 | 7251951616 | 9160359936 | 7985954816 | 4294967296 | 1073741824 | 36621093750 |
Computed in your browser ?
Technical details
- Node id
n-e9fc958a2cab6bd7· revision 1 · JSON- Definition source
derived:obreschkoff_combination- Fingerprint
f6-13cd5a379fa767ee
Observed on the stored rows ?
- Degrees: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 (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 ℚ): yes
OEIS matches ?
- A168923: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168875: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168827: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A003948: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168779: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168731: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168683: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A167897: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
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: 2, 4; 1: 2, 12, 16; 2: 2, 20, 64, 64; 3: 2, 28, 144, 320, 256; 4: 2, 36, 256, 896, 1536, 1024; 5: 2, 44, 400, 1920, 5120, 7168, 4096; 6: 2, 52, 576, 3520, 12800, 27648, 32768, 16384; 7: 2, 60, 784, 5824, 26880, 78848, 143360, 147456, 65536; 8: 2, 68, 1024, 8960, 50176, 186368, 458752, 720896, 655360, 262144; 9: 2, 76, 1296, 13056, 86016, 387072, 1204224, 2555904, 3538944, 2883584, 1048576;
%F FormulaThe row polynomials satisfy P(n,x) = (1+4*x)*P(n-1,x) for n >= 1, with P(0,x) = 2 + 4*x.
%t MathematicaP[0, x_] := 2 + 4*x;
P[n_, x_] := P[n, x] = Expand[(1 + 4*x)*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] = 2 + 4*x; for(n = 1, N, my(i = n + 1); v[i] = (1 + 4*x)*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)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-1866a96f98a4765c
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
-
obreschkoff_combination
e-1866a96f98a4765cHermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?
-
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, +inf)
-
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.
uses: Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1no recorded property covers this requirement
-
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
- [Fis06] Steve Fisk. Polynomials, roots, and interlacing. arXiv:math/0612833. arXiv
- [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
- [Obr63] Nikola Obreschkoff. Verteilung und berechnung der nullstellen reeller polynome. Hochschulbücher für mathematik, VEB Deutscher Verlag der Wissenschaften, 1963.