Sylvester's double sums: the general case (Q1030249): Difference between revisions

Let \(A\), \(B\) be finite ordered sets of distinct indeterminates. For each \(0\leq p\leq|A|\), \(0\leq q\leq|B|\) one defines the following double-sum \[ \text{Sylv}^{p,q}(A,B;x)=\sum_{\substack{{A'\subset A,\;B'\subset B}\\ |A'|=p,\;|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 \(R(Y,Z)=\prod_{y\in Y,\;z\in Z}(y-z)\), and \(R(y,Z)=\prod_{z\in Z}(y-z)\). For two univariate polynomials \(f=\prod_{\alpha\in A}(x-\alpha)\) and \(g=\prod_{\beta\in A}(x-\beta)\) with \(|A|=m\geq 1\) and \(|B|=n\geq 1\) there are formulas which relate \(\text{Sylv}^{p,q}(A,B;x)\) to \(\text{Sres}_d(f,g)\), the \(d\)-th subresultant of the polynomials \(f\) and \(g\). For instance, Sylvester proved that \[ \text{Sylv}^{p,q}(A,B;x)=(-1)^{p(m-d)}{d\choose p}\text{Sres}_d(f,g),\quad\text{for }0\leq d=p+q<m\leq n. \] Other formulas are known, but do not completely cover all possible values of \(p\) and \(q\) such that \(0\leq p\leq m\) and \(0\leq q\leq n\). The main Theorem of the paper provides expressions for all the possible values of \(p\) and \(q\). Moreover, the authors use a uniform technique that can be applied to all the possible cases.