Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Upper bound on the number of extensions of a given number field (2010.13489v4)

Published 26 Oct 2020 in math.NT

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

We haven't generated a summary for this paper yet.