Hilbert's 13th problem in prime characteristic
Abstract
The resolvent degree rdC(n) is the smallest integer d such that a root of the general polynomial f(x) = xn + a1 xn-1 + … + an can be expressed as a composition of algebraic functions in at most d variables with complex coefficients. It is known that rdC(n) = 1 when n ≤slant 5. Hilbert was particularly interested in the next three cases: he asked if rdC(6) = 2 (Hilbert's Sextic Conjecture), rdC(7) = 3 (Hilbert's 13th Problem) and rdC(8) = 4 (Hilbert's Octic Conjecture). These problems remain open. It is known that rdC(6) ≤slant 2, rdC(7) ≤slant 3 and rdC(8) ≤slant 4. It is not known whether or not rdC(n) can be > 1 for any n ≥slant 6. In this paper, we show that all three of Hilbert's conjectures can fail if we replace C with a base field of positive characteristic.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.