A038291 → basis A013610
nonnegative coefficients only rational roots
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · 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 | 10 | 3 | 13 | |||||||||||||
| 2 | 100 | 60 | 9 | 169 | ||||||||||||
| 3 | 1000 | 900 | 270 | 27 | 2197 | |||||||||||
| 4 | 10000 | 12000 | 5400 | 1080 | 81 | 28561 | ||||||||||
| 5 | 100000 | 150000 | 90000 | 27000 | 4050 | 243 | 371293 | |||||||||
| 6 | 1000000 | 1800000 | 1350000 | 540000 | 121500 | 14580 | 729 | 4826809 | ||||||||
| 7 | 10000000 | 21000000 | 18900000 | 9450000 | 2835000 | 510300 | 51030 | 2187 | 62748517 | |||||||
| 8 | 100000000 | 240000000 | 252000000 | 151200000 | 56700000 | 13608000 | 2041200 | 174960 | 6561 | 815730721 | ||||||
| 9 | 1000000000 | 2700000000 | 3240000000 | 2268000000 | 1020600000 | 306180000 | 61236000 | 7873200 | 590490 | 19683 | 10604499373 | |||||
| 10 | 10000000000 | 30000000000 | 40500000000 | 32400000000 | 17010000000 | 6123600000 | 1530900000 | 262440000 | 29524500 | 1968300 | 59049 | 137858491849 | ||||
| 11 | 100000000000 | 330000000000 | 495000000000 | 445500000000 | 267300000000 | 112266000000 | 33679800000 | 7217100000 | 1082565000 | 108256500 | 6495390 | 177147 | 1792160394037 | |||
| 12 | 1000000000000 | 3600000000000 | 5940000000000 | 5940000000000 | 4009500000000 | 1924560000000 | 673596000000 | 173210400000 | 32476950000 | 4330260000 | 389723400 | 21257640 | 531441 | 23298085122481 | ||
| 13 | 10000000000000 | 39000000000000 | 70200000000000 | 77220000000000 | 57915000000000 | 31274100000000 | 12509640000000 | 3752892000000 | 844400700000 | 140733450000 | 16888014000 | 1381746600 | 69087330 | 1594323 | 302875106592253 | |
| 14 | 100000000000000 | 420000000000000 | 819000000000000 | 982800000000000 | 810810000000000 | 486486000000000 | 218918700000000 | 75057840000000 | 19702683000000 | 3940536600000 | 591080490000 | 64481508000 | 4836113100 | 223205220 | 4782969 | 3937376385699289 |
Generated b-files: A001022 (row sums), A038228 (reversed triangle), A038305 ?
Computed in your browser ?
Technical details
- Node id
n-6ca7f61b6ad83377· revision 1 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-1024c0779b1dc97d
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 ?
- A038305: triangle, 35 terms agree, 7 full rows row-aligned (tabl) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 0 ?
- A001022: 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 ?
- A038228: reversed triangle, 36 terms agree, 8 full rows row-aligned (tabl) OEIS nonn · view at the OEIS · generated b-file 990 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: 10, 3; 2: 100, 60, 9; 3: 1000, 900, 270, 27; 4: 10000, 12000, 5400, 1080, 81; 5: 100000, 150000, 90000, 27000, 4050, 243; 6: 1000000, 1800000, 1350000, 540000, 121500, 14580, 729; 7: 10000000, 21000000, 18900000, 9450000, 2835000, 510300, 51030, 2187; 8: 100000000, 240000000, 252000000, 151200000, 56700000, 13608000, 2041200, 174960, 6561; 9: 1000000000, 2700000000, 3240000000, 2268000000, 1020600000, 306180000, 61236000, 7873200, 590490, 19683;
%F FormulaThe row polynomials satisfy P(n,x) = (10+3*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(10 + 3*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] = 1; for(n = 1, N, my(i = n + 1); v[i] = (10 + 3*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.
A038228: reversed triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 3, 10; 2: 9, 60, 100; 3: 27, 270, 900, 1000; 4: 81, 1080, 5400, 12000, 10000; 5: 243, 4050, 27000, 90000, 150000, 100000; 6: 729, 14580, 121500, 540000, 1350000, 1800000, 1000000; 7: 2187, 51030, 510300, 2835000, 9450000, 18900000, 21000000, 10000000; 8: 6561, 174960, 2041200, 13608000, 56700000, 151200000, 252000000, 240000000, 100000000; 9: 19683, 590490, 7873200, 61236000, 306180000, 1020600000, 2268000000, 3240000000, 2700000000, 1000000000;
%F FormulaRow n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (10+3*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(10 + 3*x)*P[n - 1, x]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {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] = (10 + 3*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)Generated with polytool c48629374597.
A038305: triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 10, 3; 2: 100, 60, 9; 3: 1000, 900, 270, 27; 4: 10000, 12000, 5400, 1080, 81; 5: 100000, 150000, 90000, 27000, 4050, 243; 6: 1000000, 1800000, 1350000, 540000, 121500, 14580, 729; 7: 10000000, 21000000, 18900000, 9450000, 2835000, 510300, 51030, 2187; 8: 100000000, 240000000, 252000000, 151200000, 56700000, 13608000, 2041200, 174960, 6561; 9: 1000000000, 2700000000, 3240000000, 2268000000, 1020600000, 306180000, 61236000, 7873200, 590490, 19683;
%F FormulaThe row polynomials satisfy P(n,x) = (10+3*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(10 + 3*x)*P[n - 1, x]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {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] = (10 + 3*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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-8d10edd099560dc3 -
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-8d10edd099560dc3 -
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-8d10edd099560dc3
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
-
basis_map A013610
e-8d10edd099560dc3Geometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-c055c0541343b096root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers periodic_product
e-6d834ef5c24f37f2root: theorem checkParent-row provers of polytool polytool ?
-
basis_map A007318
e-a986b288b7f6003dGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*1^j.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-b6a9810385e1026eroot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A007318
e-403b5075da2bf036Geometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*7^(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-c0e43064b314c6c0root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers periodic_product
e-7e8833b30e1c308eroot: theorem checkParent-row provers of polytool polytool ?
-
basis_map A007318
e-cffbbf28e801bdbfGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*6^(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-29094c360cdb0314root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers periodic_product
e-e8d1c828e3ebc417root: theorem checkParent-row provers of polytool polytool ?
-
basis_map A007318
e-efe1634c04c9236aGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is 5^(i-j)*binomial(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-f2f89dae9298aff8root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers periodic_product
e-868f364735375874root: theorem checkParent-row provers of polytool polytool ?
-
basis_map A007318
e-8f220a12633250f0Geometric basis map (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-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-2d1c3ef96dc1c123(expanded above) -
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-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-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]
-
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 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-2786234a932620b2(expanded above) -
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-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-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-0d085d05819c04f2(expanded above) -
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-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
-
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
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
-
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-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 of coefficients in expansion of (1+2*x)^n.
-
↵ parent_provers periodic_product
e-1697ba43e31b7729(expanded above) -
↵ basis_map A007318
e-4608a916413bc814(expanded above) -
↵ preserver_image affine, shift 0
e-17c52917511dc051(expanded above)
-
-
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).
-
↵ theorem_check liu_wang
-
premise (sequence):
Cube of lower triangular normalized binomial matrix.
-
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-a6866143cc223753(expanded above) -
↵ basis_map A013609
e-41b2234a78052e4f(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-4c4f74d9ba733cff(expanded above) -
↵ preserver_image reversal, shift 0
e-6d15baf5e54583ee(expanded above) -
↵ parent_provers periodic_product
e-d08b7f9df01d4f3c(expanded above) -
↵ preserver_image mobius, shift 0
e-2c323256b27180b8(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle of coefficients in expansion of (1+2*x)^n.
-
-
premise (sequence):
Triangle of coefficients in expansion of (1+3*x)^n.
-
↵ parent_provers periodic_product
e-58678fea8a24dd74(expanded above) -
↵ basis_map A007318
e-7b97c40e19745577(expanded above) -
↵ preserver_image affine, shift 0
e-4b09f87a5a93f62b(expanded above)
-
-
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.
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j).
-
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]
-
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-035d18f235569c81(expanded above) -
↵ basis_map A013610
e-404109e50a21afd4(expanded above) -
↵ preserver_image reversal, shift 0
e-b03bb7746bf562de(expanded above) -
↵ parent_provers periodic_product
e-bd3566bc3465f71b(expanded above) -
↵ preserver_image mobius, shift 0
e-33c9dd76a325511a(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle of coefficients in expansion of (1+3*x)^n.
-
-
premise (sequence):
Triangle of coefficients in expansion of (1+4x)^n.
-
↵ basis_map A007318
e-9f0b70d11cb8d495(expanded above) -
↵ parent_provers periodic_product
e-bf59fe80a0559f3e(expanded above) -
↵ preserver_image affine, shift 0
e-4db64ce997502606(expanded above)
-
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j).
-
preserver_image affine, shift 0
e-0ab1d5f59b4d29a0Affine, 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-2d1c3ef96dc1c123(expanded above) -
↵ preserver_image reversal, shift 0
e-6e49a6f9dd41e218(expanded above) -
↵ basis_map A007318
e-9f0b70d11cb8d495(expanded above) -
↵ parent_provers periodic_product
e-bf59fe80a0559f3e(expanded above) -
↵ preserver_image affine, shift 0
e-4db64ce997502606(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j).
-
-
premise (sequence):
Triangle whose (i,j)-th entry is 5^(i-j)*binomial(i,j).
-
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j).
-
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j).
-
parent_provers periodic_product
e-e44a3cf5ca807197root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*1^j.
-
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.
Related sequences ?
Same fingerprint (2)
Equal up to content, sign, reversal and a small index shift.
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