Sylvester's double sums: an inductive proof of the general case (Q414627): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(8 intermediate revisions by 6 users not shown) | |||
Property / review text | |||
Let \(A\) and \(B\) be two set of indeterminants. For every pair of integers \(p\) and \(q\), such that \(0\leq p\leq |A|\) and \(0\leq q\leq |B|\), in 1853 Sylvester defined the following polynomial in the variable \(x\) called the double sum expression in \(A\) and \(B\): \[ \mathrm{Syl}^{p,q}(A,B):=\sum_{A'\subset A, |A'|=p;\,\,B'\subset B, |B'|=q}R(x,A')R(x,B')\frac{R(A',B')R(A\setminus A',B\setminus B')}{R(A',A\setminus A')R(B',B\setminus B')}, \] where for two sets of indeterminants \(X\) and \(Y\) one has \[ R(X,Y)=\Pi_{y\in Y,x\in X}(y-x). \] For two polynomials \[ f=\Pi_{\alpha\in A}(x-\alpha), \] \[ g=\Pi_{\beta\in B}(x-\beta) \] one can consider the \(k\)-th subresultant \(\mathrm{Sres}_k(f,g)\). The subresultant is a polynomial in \(x\), it is defined as a determinant of a matrix, whose elements are either coefficients of \(f\) and \(g\) or polynomials \(f\) and \(g\) multiplied by some power of \(x\). As it was pointed out by Sylvester in 1853, double sums can be expressed through \(f\) and \(g\) and the subresultants of \(f\) and \(g\). However for some \(p\) and \(q\) he did not give explicit expressions. They were given by \textit{C. D'Andrea, H. Hong, T. Krick} and \textit{A. Szanto} [``Sylvester's double sums: the general case'', J. Symb. Comput. 44, No. 9, 1164--1175 (2009; Zbl 1217.13013)] . Later \textit{M.-F. Roy} and \textit{A. Szpirglas} [``Sylvester double sums and subresultants'', J. Symb. Comput. 46, No. 4, 385--395 (2011; Zbl 1213.12003)] had given in some cases an elementary proof of this result. The main result of the paper under review is a new elementary proof of these results in all cases. As the authors say, the main motivation is to explore and tackle the problem concerning of the definition of Sylvester's double sums to the case of multiple roots and their connection to subresultants. | |||
Property / review text: Let \(A\) and \(B\) be two set of indeterminants. For every pair of integers \(p\) and \(q\), such that \(0\leq p\leq |A|\) and \(0\leq q\leq |B|\), in 1853 Sylvester defined the following polynomial in the variable \(x\) called the double sum expression in \(A\) and \(B\): \[ \mathrm{Syl}^{p,q}(A,B):=\sum_{A'\subset A, |A'|=p;\,\,B'\subset B, |B'|=q}R(x,A')R(x,B')\frac{R(A',B')R(A\setminus A',B\setminus B')}{R(A',A\setminus A')R(B',B\setminus B')}, \] where for two sets of indeterminants \(X\) and \(Y\) one has \[ R(X,Y)=\Pi_{y\in Y,x\in X}(y-x). \] For two polynomials \[ f=\Pi_{\alpha\in A}(x-\alpha), \] \[ g=\Pi_{\beta\in B}(x-\beta) \] one can consider the \(k\)-th subresultant \(\mathrm{Sres}_k(f,g)\). The subresultant is a polynomial in \(x\), it is defined as a determinant of a matrix, whose elements are either coefficients of \(f\) and \(g\) or polynomials \(f\) and \(g\) multiplied by some power of \(x\). As it was pointed out by Sylvester in 1853, double sums can be expressed through \(f\) and \(g\) and the subresultants of \(f\) and \(g\). However for some \(p\) and \(q\) he did not give explicit expressions. They were given by \textit{C. D'Andrea, H. Hong, T. Krick} and \textit{A. Szanto} [``Sylvester's double sums: the general case'', J. Symb. Comput. 44, No. 9, 1164--1175 (2009; Zbl 1217.13013)] . Later \textit{M.-F. Roy} and \textit{A. Szpirglas} [``Sylvester double sums and subresultants'', J. Symb. Comput. 46, No. 4, 385--395 (2011; Zbl 1213.12003)] had given in some cases an elementary proof of this result. The main result of the paper under review is a new elementary proof of these results in all cases. As the authors say, the main motivation is to explore and tackle the problem concerning of the definition of Sylvester's double sums to the case of multiple roots and their connection to subresultants. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 13P15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15A15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6033269 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Sylvester's double sums | |||
Property / zbMATH Keywords: Sylvester's double sums / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
subresultants | |||
Property / zbMATH Keywords: subresultants / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
polynomial | |||
Property / zbMATH Keywords: polynomial / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
determinant | |||
Property / zbMATH Keywords: determinant / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Dmitry V. Artamonov / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2020399563 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57431033 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1106.4770 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subresultants and Reduced Polynomial Remainder Sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An elementary proof of Sylvester's double sums for subresultants / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sylvester's double sums: the general case / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4406533 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4023676 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sylvester subresultants, rational Cauchy approximations, Thiele's continued fractions and higher Bruhat orders / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Double Sylvester sums for subresultants and multi-Schur functions. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sylvester double sums and subresultants / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:10, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sylvester's double sums: an inductive proof of the general case |
scientific article |
Statements
Sylvester's double sums: an inductive proof of the general case (English)
0 references
11 May 2012
0 references
Let \(A\) and \(B\) be two set of indeterminants. For every pair of integers \(p\) and \(q\), such that \(0\leq p\leq |A|\) and \(0\leq q\leq |B|\), in 1853 Sylvester defined the following polynomial in the variable \(x\) called the double sum expression in \(A\) and \(B\): \[ \mathrm{Syl}^{p,q}(A,B):=\sum_{A'\subset A, |A'|=p;\,\,B'\subset B, |B'|=q}R(x,A')R(x,B')\frac{R(A',B')R(A\setminus A',B\setminus B')}{R(A',A\setminus A')R(B',B\setminus B')}, \] where for two sets of indeterminants \(X\) and \(Y\) one has \[ R(X,Y)=\Pi_{y\in Y,x\in X}(y-x). \] For two polynomials \[ f=\Pi_{\alpha\in A}(x-\alpha), \] \[ g=\Pi_{\beta\in B}(x-\beta) \] one can consider the \(k\)-th subresultant \(\mathrm{Sres}_k(f,g)\). The subresultant is a polynomial in \(x\), it is defined as a determinant of a matrix, whose elements are either coefficients of \(f\) and \(g\) or polynomials \(f\) and \(g\) multiplied by some power of \(x\). As it was pointed out by Sylvester in 1853, double sums can be expressed through \(f\) and \(g\) and the subresultants of \(f\) and \(g\). However for some \(p\) and \(q\) he did not give explicit expressions. They were given by \textit{C. D'Andrea, H. Hong, T. Krick} and \textit{A. Szanto} [``Sylvester's double sums: the general case'', J. Symb. Comput. 44, No. 9, 1164--1175 (2009; Zbl 1217.13013)] . Later \textit{M.-F. Roy} and \textit{A. Szpirglas} [``Sylvester double sums and subresultants'', J. Symb. Comput. 46, No. 4, 385--395 (2011; Zbl 1213.12003)] had given in some cases an elementary proof of this result. The main result of the paper under review is a new elementary proof of these results in all cases. As the authors say, the main motivation is to explore and tackle the problem concerning of the definition of Sylvester's double sums to the case of multiple roots and their connection to subresultants.
0 references
Sylvester's double sums
0 references
subresultants
0 references
polynomial
0 references
determinant
0 references
0 references