Bibliographic record
Abstract
The algebraic form of Hilbert's 13th problem asks for the resolvent degree \operatorname{RD}(n) of the general polynomial f(x) = x^n + a_1 x^{n-1} + \cdots + 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 \leqslant\nobreak d variables at each step. Recently Farb and Wolfson defined the resolvent degree \operatorname{RD}_k(G) for every finite group G and any base field k of characteristic 0 . In this setting \operatorname{RD}(n) = \operatorname{RD}_{\mathbb{C}}(\operatorname{S}_n) , where \operatorname{S}_n denotes the symmetric group. In this paper we extend their definition of \operatorname{RD}_k(G) to an arbitrary algebraic {group} G over an arbitrary field k . We investigate the dependency of this quantity on k and show that \operatorname{RD}_k(G) \leqslant 5 for any field k and any connected group G . The question whether \operatorname{RD}_k(G) can be bigger than 1 for any field k and any algebraic group G over k (not necessarily connected) remains open.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.009 |
| Scholarly communication | 0.004 | 0.008 |
| Open science | 0.001 | 0.004 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.008 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".