Explicit Approximations to Class Field Towers

From MaRDI portal





Abstract: We answer a question of Peikert and Rosen by giving for each epsilon>0 an efficient construction of infinite families of number fields N such that the root discriminant DN1/[N:mathbbQ] is bounded above by a constant times [N:mathbbQ]epsilon.












This page was built for publication: Explicit Approximations to Class Field Towers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6423350)