# Resolvent degree, Hilbert’s 13th Problem and geometry

```@article{Farb2020ResolventDH,
title={Resolvent degree, Hilbert’s 13th Problem and geometry},
author={Benson Farb and Jesse Wolfson},
journal={L’Enseignement Math{\'e}matique},
year={2020}
}```
• Published 11 March 2018
• Mathematics
• L’Enseignement Mathématique
We develop the theory of resolvent degree, introduced by Brauer \cite{Br} in order to study the complexity of formulas for roots of polynomials and to give a precise formulation of Hilbert's 13th Problem. We extend the context of this theory to enumerative problems in algebraic geometry, and consider it as an intrinsic invariant of a finite group. As one application of this point of view, we prove that Hilbert's 13th Problem, and his Sextic and Octic Conjectures, are equivalent to various…
Advancement to Candidacy Topic Proposal Solving Polynomials After Klein : The Theory of Resolvent Degree
Solving polynomials is a classical problem. Here, we take a geometric/topological approach that combines the classical viewpoints pioneered by Klein and Hilbert (among others) and the modern
Removal of 5 Terms from a Degree 21 Polynomial
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
Tschirnhaus transformations after Hilbert
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
Hilbert's 13th Problem for Algebraic Groups
. The algebraic form of Hilbert’s 13th Problem asks for the resolvent degree rd( n ) of the general polynomial f ( x ) = x n + a 1 x n − 1 + . . . + a n of degree n , where a 1 , . . . , a n are
Upper Bounds on Resolvent Degree via Sylvester's Obliteration Algorithm
• Mathematics, Computer Science
• 2021
An algorithm of Sylvester for determining non-zero solutions of systems of homogeneous polynomials is recovered from a modern algebro-geometric perspective and used to determine improved thresholds for upper bounds on RD(n).
Modular functions and resolvent problems
• Mathematics
Mathematische Annalen
• 2022
The link between modular functions and algebraic functions was a driving force behind the 19th century study of both. Examples include the solutions by Hermite and Klein of the quintic via elliptic
Differential Essential Dimension
This thesis defines an analogue of essential dimension in differential algebra and shows that the number of parameters in a general homogeneous linear differential equation over a field cannot be reduced via gauge transformations over the given field.
Upper Bounds on Resolvent Degree and Its Growth Rate
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 1945, Segre called for a better
From Hilbert’s 13th problem to essential dimension and back
• Z. Reichstein
• Mathematics
European Mathematical Society Magazine
• 2021
goes back to ancient times. Here by “solving" I mean finding a procedure or a formula which produces a solution x for a given set of coefficients a1, . . . , an. The terms “procedure" and “formula"
The essential dimension of congruence covers
• Mathematics
Compositio Mathematica
• 2021
Abstract Consider the algebraic function \$\Phi _{g,n}\$ that assigns to a general \$g\$-dimensional abelian variety an \$n\$-torsion point. A question first posed by Klein asks: What is the minimal \$d\$