Brauer's conjecture on the resolvent degree of the general polynomial

For each nn, let Pn\mathcal{P}_n be the parameter space of degree-nn polynomials and let P~nPn\widetilde{\mathcal{P}}_n\to\mathcal{P}_n be the associated cover parametrizing a root. The quantity RD(P~nPn)\operatorname{RD}(\widetilde{\mathcal{P}}_n\to\mathcal{P}_n) is the resolvent degree of solving the general degree-nn polynomial. Brauer's conjecture.

RD(P~nPn)as n.\operatorname{RD}(\widetilde{\mathcal{P}}_n\to \mathcal{P}_n)\to\infty\quad\text{as }n\to\infty.

The source presents this as a stronger statement motivated by the unresolved problem of proving that some problem has resolvent degree greater than 11. Although the statement is attributed to Brauer in the surrounding discussion, no resolution is supplied here.

Sources & referencesView supporting material

Primary source

Benson Farb and Jesse Wolfson, “Resolvent degree, Hilbert's 13th Problem and geometry”, arXiv:1803.04063 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.