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

Tschirnhaus transformations after Hilbert (2001.06515v2)

Published 17 Jan 2020 in math.AG and math.NT

Abstract: Let RD(n) denote the minimum d for which there exists a formula for the roots of the general degree n polynomial using only algebraic functions of d or fewer variables. In 1927, Hilbert sketched how the 27 lines on a cubic surface could be used to construct a 4-variable formula for the general degree 9 polynomial (implying $RD(9)\le 4$). In this paper, we turn Hilbert's sketch into a general method. We show this method produces best-to-date upper bounds on RD(n) for all n, improving earlier results of Hamilton, Sylvester, Segre and Brauer.

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.