Papers
Topics
Authors
Recent
2000 character limit reached

Upper bound on the number of extensions of a given number field

Published 26 Oct 2020 in math.NT | (2010.13489v4)

Abstract: In this paper we improve the upper bound of the number $N_{K, n}(X)$ of degree $n$ extensions of a number field $K$ with absolute discriminant bounded by $X$. This is achieved by giving a short $\mathcal{O}K$-basis of an order of an extension $L$ of $K$. Our result generalizes the best known upper bound on $N{\mathbb{Q}, n}(X)$ by Lemke Oliver and Thorne to all number fields $K$. Precisely, we prove that $N_{K, n}(X) \ll_{K, n} X{c (\log n)2}$ for an explicit constant $c$ independent on $K$ and $n$. We also improve the upper bound of the number of maximal arithmetic subgroups in certain connected semisimple Lie groups.

Summary

Paper to Video (Beta)

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.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.