Papers
Topics
Authors
Recent
Search
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 &gt; 0$ an efficient construction of infinite families of number fields NN such that the root discriminant DN<sup>1/[N:Q]D_N<sup>{1/[N:\mathbb{Q}]} is bounded above by a constant times [N:Q]<sup>ϵ[N:\mathbb{Q}]<sup>\epsilon.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.