中文
相关论文

相关论文: Upper Bounds for the Number of Number Fields with …

200 篇论文

A well-known result of von zur Gathen asserts that a non-exceptional permutation polynomial of degree $n$ over $\mathbb{F}_{q}$ exists only if $q<n^{4}$. With the help of the Weil bound for the number of $\mathbb{F}_{q}$-points on an…

数论 · 数学 2018-12-07 Xiang Fan

We prove new conditional bounds on the the $m$-torsion of class groups of number fields of any fixed degree, for $m=2$, $3$, $4$, and $5$. Our methods first recast the problem in the language of class groups of Galois modules, which allows…

数论 · 数学 2023-08-08 Arul Shankar , Jacob Tsimerman

In this paper we give a survey of recent methods for the asymptotic and exact enumeration of number fields with given Galois group of the Galois closure. In particular, the case of fields of degree up to 4 is now almost completely solved,…

数论 · 数学 2015-06-26 Henri Cohen

Algorithms working with linear algebraic groups often represent them via defining polynomial equations. One can always choose defining equations for an algebraic group to be of the degree at most the degree of the group as an algebraic…

代数几何 · 数学 2021-08-31 Eli Amzallag , Andrei Minchenko , Gleb Pogudin

We present a new algorithm for improving lower bounds on $ex(n;\{C_3,C_4\})$, the maximum size (number of edges) of an $n$-vertex graph of girth at least 5. The core of our algorithm is a variant of a hill-climbing heuristic introduced by…

组合数学 · 数学 2025-08-08 Jan Goedgebeur , Jorik Jooken , Gwenaël Joret , Tibo Van den Eede

The paper studies the probability for a Galois group of a random polynomial to be $A_n$. We focus on the so-called large box model, where we choose the coefficients of the polynomial independently and uniformly from $\{-L,\ldots, L\}$. The…

数论 · 数学 2024-04-02 Lior Bary-Soroker , Or Ben-Porath , Vlad Matei

Let K be a Galois number field of prime degree $\ell$. Heilbronn showed that for a given $\ell$ there are only finitely many such fields that are norm-Euclidean. In the case of $\ell=2$ all such norm-Euclidean fields have been identified,…

数论 · 数学 2011-04-15 Kevin J. McGown

For any integer n >= 2 and any nonnegative integers r,s with r+2s = n, we give an unconditional construction of infinitely many monic irreducible polynomials of degree n with integer coefficients having squarefree discriminant and exactly r…

数论 · 数学 2011-05-05 Kiran S. Kedlaya

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

数论 · 数学 2018-07-09 Fusun Akman

When monic integral polynomials of degree $n \geq 2$ are ordered by the maximum of the absolute value of their coefficients, the Hilbert irreducibility theorem implies that asymptotically 100% are irreducible and have Galois group…

数论 · 数学 2019-10-08 Robert J. Lemke Oliver , Frank Thorne

We realize infinitely many covering groups $2.A_n$ (where $A_n$ is the alternating group) as the Galois group of everywhere unramified Galois extensions over infinitely many quadratic number fields. After several predecessor works…

数论 · 数学 2025-10-16 Joachim König

We investigate unramified extensions of number fields with prescribed solvable Galois group and certain extra conditions. In particular, we are interested in the minimal degree of a number field $K$, Galois over $\mathbb{Q}$, such that $K$…

数论 · 数学 2021-07-01 Joachim König

Let $K$ be a field of degree $n$ and discriminant with absolute value $\Delta$. Under the assumption of the validity of the Generalized Riemann Hypothesis, we provide a new algorithm to compute a set of generators of the class group of $K$…

数论 · 数学 2025-06-19 Loïc Grenié , Giuseppe Molteni

In this paper, we study numbers $n$ that can be factored in four different ways as $n = A B = (A + a_1) (B - b_1) = (A + a_2) (B - b_2) = (A + a_3) (B - b_3)$ with $B \le A$, $1 \le a_1 < a_2 < a_3 \le C$ and $1 \le b_1 < b_2 < b_3 \le C$.…

数论 · 数学 2025-08-06 Tsz Ho Chan , Laura Holmes , Michael Liu , Jose Villarreal

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 $L/K$ be a Galois extension of number fields. We prove two lower bounds on the maximum of the degrees of the irreducible complex representations of ${\rm Gal}(L/K)$, the sharper of which is conditional on the Artin Conjecture and the…

数论 · 数学 2016-01-20 Jeremy Rouse , Frank Thorne

We give an asymptotic lower bound on the number of field extensions generated by algebraic points on superelliptic curves over $\mathbb{Q}$ with fixed degree $n$ and discriminant bounded by $X$. For $C$ a fixed such curve given by an affine…

数论 · 数学 2025-09-17 Lea Beneish , Christopher Keyes

We prove an upper bound for the asymptotics of counting functions of number fields with nilpotent Galois groups.

数论 · 数学 2020-11-10 Jürgen Klüners

The paper is concerned with the following version of Hilbert's irreducibility theorem: if $\pi: X \to Y$ is a Galois $G$-covering of varieties over a number field $k$ and $H \subset G$ is a subgroup, then for all sufficiently large and…

数论 · 数学 2022-07-28 Borys Kadets

Let $G$ be a connected graph on $n$ vertices. The Gallai number $Gal(G)$ of $G$ is the size of the smallest set of vertices that meets every maximum path in $G$. Gr\"unbaum constructed a graph $G$ with $Gal(G)=3$. Very recently, Long,…

组合数学 · 数学 2023-05-10 Henry Kierstead , Eric Ren