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

Hilbert's 13th Problem for Algebraic Groups (2204.13202v1)

Published 27 Apr 2022 in math.GR, math.AC, and math.AG

Abstract: The algebraic form of Hilbert's 13th Problem asks for the resolvent degree $\text{rd}(n)$ of the general polynomial $f(x) = xn + a_1 x{n-1} + \ldots + a_n$ of degree $n$, where $a_1, \ldots, a_n$ are independent variables. The resolvent degree is the minimal integer $d$ such that every root of $f(x)$ can be obtained in a finite number of steps, starting with $\mathbb C(a_1, \ldots, a_n)$ and adjoining algebraic functions in $\leq d$ variables at each step. Recently Farb and Wolfson defined the resolvent degree $\text{rd}k(G)$ of any finite group $G$ and any base field $k$ of characteristic $0$. In this setting $\text{rd}(n) = \text{rd}{\mathbb C}(S_n)$, where $S_n$ denotes the symmetric group. In this paper we define $\text{rd}_k(G)$ for every algebraic group $G$ over an arbitrary field $k$, investigate the dependency of this quantity on $k$ and show that $\text{rd}_k(G) \leq 5$ for any field $k$ and any connected group $G$. The question of whether $\text{rd}_k(G)$ can be bigger than $1$ for any field $k$ and any algebraic group $G$ over $k$ (not necessarily connected) remains open.

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.