中文
相关论文

相关论文: Upper bounds on number fields of given degree and …

200 篇论文

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…

数论 · 数学 2021-06-04 Jungin Lee

We study the number $N(n, A_n, X)$ of number fields of degree $n$ whose Galois closure has Galois group $A_n$ and whose discriminant is bounded by $X$. By a conjecture of Malle, we expect that $N(n, A_n, X) \sim C_n X^{1/2} (\log X)^{b_n}$,…

数论 · 数学 2011-07-07 Eric Larson , Larry Rolen

We study the number of degree $n$ number fields with discriminant bounded by $X$. In this article, we improve an upper bound due to Schmidt on the number of such fields that was previously the best known upper bound for $6 \leq n \leq 94$.

We give an upper bound on the number of extensions of a fixed number field of prescribed degree and discriminant less than X; these bounds improve on work of Schmidt. We also prove various related results, such as lower bounds for the…

数论 · 数学 2007-05-23 Jordan S. Ellenberg , Akshay Venkatesh

We prove an improvement on Schmidt's upper bound on the number of number fields of degree $n$ and absolute discriminant less than X for $6 \leq n \leq 94$. We carry this out by improving and applying a uniform bound on the number of monic…

数论 · 数学 2022-10-04 Manjul Bhargava , Arul Shankar , Xiaoheng Wang

We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.

数论 · 数学 2019-08-30 Jean-Marc Couveignes

Let $n \geq 6$ be an integer. We prove that the number of number fields with Galois group $A_n$ and absolute discriminant at most $X$ is asymptotically at least $X^{1/8 + O(1/n)}$. For $n \geq 8$ this improves upon the previously best known…

数论 · 数学 2021-12-03 Aaron Landesman , Robert J. Lemke Oliver , Frank Thorne

Let $n$ be a positive integer and $G$ be a transitive permutation subgroup of $S_n$. Given a number field $K$ with $[K:\mathbb{Q}]=n$, we let $\widetilde{K}$ be its Galois closure over $\mathbb{Q}$ and refer to…

数论 · 数学 2023-10-03 Hrishabh Mishra , Anwesh Ray

Let $N(5,D_5,X)$ be the number of quintic number fields whose Galois closure has Galois group $D_5$ and whose discriminant is bounded by $X$. By a conjecture of Malle, we expect that $N(5,D_5,X) \sim C X^{1/2}$ for some constant $C$. The…

数论 · 数学 2011-11-08 Eric Larson , Larry Rolen

An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…

量子物理 · 物理学 2023-03-15 Nikhil S. Mande , Justin Thaler , Shuchen Zhu

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

数论 · 数学 2021-11-18 Rainer Dietmann , Alina Ostafe , Igor E. Shparlinski

We derive an upper bound on the number of models for exact satisfiability (XSAT) of arbitrary CNF formulas F. The bound can be calculated solely from the distribution of positive and negated literals in the formula. For certain subsets of…

计算复杂性 · 计算机科学 2018-03-21 Bernd Schuh

A folklore conjecture asserts the existence of a constant $c_n > 0$ such that $\#\mathcal{F}_n(X) \sim c_n X$ as $X\to \infty$, where $\mathcal{F}_n(X)$ is the set of degree $n$ extensions $K/\mathbb{Q}$ with discriminant bounded by $X$.…

数论 · 数学 2023-12-14 Robert J. Lemke Oliver

We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…

数论 · 数学 2015-06-26 Attila Berczes , Jan-Hendrik Evertse , Kalman Gyory

Let $\tau(n)$ stand for the number of divisors of the positive integer $n$. We obtain upper bounds for $\tau(n)$ in terms of $\log n$ and the number of distinct prime factors of $n$.

数论 · 数学 2018-12-27 Jean-Marie De Koninck , Patrick Letendre

Let $\mathcal{F}_n(X;G)$ denote the set of number fields of degree $n$ with absolute discriminant no larger than $X$ and Galois group $G$. This set is known to be finite for any finite permutation group $G$ and $X \geq 1$. In this paper, we…

数论 · 数学 2024-08-14 Vittoria Cristante

In this paper, we use some of our previous results to improve an upper bound of Bayer-Fluckiger, Borello and Jossen on the Euclidean minima of algebraic number fields. Our bound depends on the degree $n$ of the field, its signature,…

数论 · 数学 2023-07-21 Artūras Dubickas , Min Sha , Igor E. Shparlinski

Let X be a projective curve defined over Q and t a non-constant Q-rational function on X of degree at least 2. For every integer n pick a point P_n on X such that t(P_n)=n. A result of Dvornicich and Zannier implies that, for large N, among…

数论 · 数学 2016-09-06 Yuri Bilu , Florian Luca

If a linear differential operator with rational function coefficients is reducible, its factors may have coefficients with numerators and denominatorsof very high degree. When the base field is $\mathbb C$, we give a completely explicit…

经典分析与常微分方程 · 数学 2020-08-05 Alin Bostan , Tanguy Rivoal , Bruno Salvy

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

数论 · 数学 2025-08-29 Omkar Baraskar , Ingrid Vukusic
‹ 上一页 1 2 3 10 下一页 ›