Papers
Topics
Authors
Recent
Search
2000 character limit reached

Removal of 5 Terms from a Degree 21 Polynomial

Published 16 Dec 2021 in math.AG | (2112.08586v1)

Abstract: 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 by mathematicians including Bring, Jerrard, Hamilton, Sylvester, and Hilbert. Many of the problems they considered can be framed in terms of the geometric notion of resolvent degree, introduced by Farb and Wolfson. Roughly speaking, we have $RD(n) \leq n-k$ if a general degree $n$ polynomial can be put into an $(n-k)$-parameter form. In the present note we discuss a method introduced by Sylvester for solving systems of polynomial equations, and apply it to finding bounds on resolvent degree. In particular, we prove the bound $RD(21) \leq 15$. This bound has been independently established by Sutherland using the classical theory of polarity.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.