The m-step Solvable Mono-anabelian Geometry of Number Fields
Abstract
The goal of this paper is to develop a group-theoretic algorithm, to reconstruct a number field (together with its maximal m-step solvable ex- tension for some positive integer m ≥ 3) from the maximal m+9-step solv- able quotient of its absolute Galois group. If K is an imaginary quadratic field or Q, we establish a group-theoretic reconstruction algorithm of K from the maximal 6-step solvable quotient of its absolute Galois group.
0
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.