Explicit Approximations to Class Field Towers
Number Theory
2026-01-27 v2
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 .
Cite
@article{arxiv.2301.05673,
title = {Explicit Approximations to Class Field Towers},
author = {Frauke M. Bleher and Ted Chinburg},
journal= {arXiv preprint arXiv:2301.05673},
year = {2026}
}
Comments
14 pages; we wrote a new section 5 relating our constructions to Redei symbols