Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 186 tok/s
Gemini 2.5 Pro 55 tok/s Pro
GPT-5 Medium 36 tok/s Pro
GPT-5 High 41 tok/s Pro
GPT-4o 124 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 440 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Removal of 5 Terms from a Degree 21 Polynomial (2112.08586v1)

Published 16 Dec 2021 in math.AG

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.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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