Upper bounds on resolvent degree via Sylvester's obliteration algorithm (Q2680143)

Let \(RD(n)\) be the resolvent degree of the general degree \(n\) polynomial, or more precisely \(RD(n):=RD(\frac{K_n[Z]}{(Z^n+a_1Z^{n-1}+\ldots+a_{n-1}Z+a_n)}\vert K_n),\) where \(K_n=\mathbb{C}(a_1,\ldots,a_{n-1}).\) The main result (Th. 4.6) determines improved upper-bounds for \(RD(n)\), leading to the construction of a new bounding function. Section 3 contains a very interesting and useful description in modern terms of the Obliteration Algorithms invented by Sylvester almost 150 years ago.