Curtis R. Heberle

collaborators

2 papers

math.AG2021

Removal of 5 Terms from a Degree 21 Polynomial

Curtis R. Heberle

In 1683 Tschirnhaus claimed to have developed an algebraic method to determine the roots of any degree $n$ polynomial. His argument was flawed, but it spurred a great deal of work…

math.AG2021

Upper Bounds on Resolvent Degree via Sylvester's Obliteration Algorithm

Curtis Heberle, Alexander J. Sutherland

For each $n$ , let RD $(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this…