SearcharxivSearch

arXiv · 2204.13202

Hilbert's 13th Problem for Algebraic Groups

Abstract

The algebraic form of Hilbert's 13th Problem asks for the resolvent degree $\text{rd}(n)$ of the general polynomial $f(x) = x^n + 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Zinovy Reichstein. 2022-04-27. Hilbert's 13th Problem for Algebraic Groups. https://arxiv.org/abs/2204.13202

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR