2000 character limit reached
Explicit Approximations to Class Field Towers
Published 13 Jan 2023 in math.NT | (2301.05673v1)
Abstract: We answer a question of Peikert and Rosen by giving for each $\epsilon > 0$ an efficient construction of infinite families of number fields such that the root discriminant is bounded above by a constant times .
Paper Prompts
Sign up for free to create and run prompts on this paper.