Explicit Approximations to Class Field Towers
arXiv:2301.05673
Abstract
We answer a question of Peikert and Rosen by giving for each an efficient construction of infinite families of number fields such that the root discriminant is bounded above by a constant times .
14 pages; we wrote a new section 5 relating our constructions to Redei symbols