中文
相关论文

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

200 篇论文

Of the $(2H+1)^n$ monic integer polynomials $f(x)=x^n+a_1 x^{n-1}+\cdots+a_n$ with $\max\{|a_1|,\ldots,|a_n|\}\leq H$, how many have associated Galois group that is not the full symmetric group $S_n$? There are clearly $\gg H^{n-1}$ such…

数论 · 数学 2024-10-01 Manjul Bhargava

Let p be an odd prime satisfying Vandiver's conjecture. We consider two objects, the Galois group X of the maximal unramified abelian pro-p extension of the compositum of all Z_p-extensions of the pth cyclotomic field and the Galois group G…

数论 · 数学 2008-07-30 Romyar T. Sharifi

We improve the lower bound for the classical exponent of approximation $w_{n}^{\ast}(\xi)$ connected to Wirsing's famous problem of approximation to real numbers by algebraic numbers of degree at most $n$. Our bound exceeds…

数论 · 数学 2019-12-20 Dzmitry Badziahin , Johannes Schleischitz

Let $f_r(n)$ represent the minimum number of complete $r$-partite $r$-graphs required to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. The Graham-Pollak theorem states that $f_2(n)=n-1$. An upper bound of…

组合数学 · 数学 2017-12-21 Anand Babu , Sundar Vishwanathan

For nonnegative integers $q,n,d$, let $A_q(n,d)$ denote the maximum cardinality of a code of length $n$ over an alphabet $[q]$ with $q$ letters and with minimum distance at least $d$. We consider the following upper bound on $A_q(n,d)$. For…

组合数学 · 数学 2018-08-07 Bart Litjens , Sven Polak , Alexander Schrijver

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

If $G$ is a $k$-chromatic graph of order $n$ then it is known that the chromatic polynomial of $G$, $\pi(G,x)$, is at most $x(x-1)\cdots (x-(k-1))x^{n-k} = (x)_{\downarrow k}x^{n-k}$ for every $x\in \mathbb{N}$. We improve here this bound…

组合数学 · 数学 2016-11-30 Jason Brown , Aysel Erey

We prove that the number of quartic fields $K$ with discriminant $|\Delta_K|\leq X$ whose Galois closure is $D_4$ equals $CX+O(X^{5/8+\varepsilon})$, improving the error term in a well-known result of Cohen, Diaz y Diaz, and Olivier. We…

数论 · 数学 2024-05-07 Kevin J. McGown , Amanda Tucker

Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz proved in a landmark article that, for any positive integer $k$, up to isomorphism there are only finitely many maximal intersecting families of $k-$sets (maximal $k-$cliques). So they posed the…

组合数学 · 数学 2014-03-03 Kaushik Majumder

Let $K$ be a number field, $A/K$ be an absolutely simple abelian variety of CM type, and $\ell$ be a prime number. We give explicit bounds on the degree over $K$ of the division fields $K(A[\ell^n])$, and when $A$ is an elliptic curve we…

数论 · 数学 2015-08-13 Davide Lombardo

Infinitely many elliptic curves over ${\bf Q}$ have a Galois-stable cyclic subgroup of order 4. Such subgroups come in pairs, which intersect in their subgroups of order 2. Let $N_i(X)$ denote the number of elliptic curves over ${\bf Q}$…

数论 · 数学 2020-05-01 Carl Pomerance , Edward F. Schaefer

We extend to an arbitrary number field the best known bounds towards the Ramanujan conjecture for the groups GL(n), n=2, 3, 4. In particular, we present a technique which overcomes the analytic obstacles posed by the presence of an infinite…

数论 · 数学 2011-03-16 Valentin Blomer , Farrell Brumley

We prove an upper bound of $n+9$ for the strong separation number of the complete graph $K_n$, and an upper bound of $n+1$ for its weak separation number. This improves on the previous best known bound of $(1+o(1))n$ for both cases.

组合数学 · 数学 2026-03-25 George Kontogeorgiou , Maya Stein

We provide a method for counting number fields of fixed Galois group ordered by arbitrary inertial invariants using analytic techniques from the study of multiple Dirichlet series. We prove unconditional results for infinitely many new…

数论 · 数学 2026-05-25 Brandon Alberts , Alina Bucur

We count abelian number fields ordered by arbitrary height function whose generator of tame inertia is restricted to lie in a given subset of the Galois group, and find an explicit formula for the leading constant. We interpret our results…

数论 · 数学 2025-07-02 Julie Tavernier

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

计算几何 · 计算机科学 2023-12-05 Friedrich Eisenbrand , Matthieu Haeberle , Neta Singer

Let $N_d(G,X)$ denote the number of degree $d$ extensions of $\mathbb{Q}$ with Galois closure $G$ and $|\Delta_K|\leq X$. Malle's conjecture predicts an asymptotic of the form $N_d(G,X)\sim CX^{\alpha}(\log X)^\beta$. Previously, Kl\"uners…

Let K be a field of characteristic 0 and let n be a natural number. Let Gamma be a subgroup of the multiplicative group $(K^\ast)^n$ of finite rank r. Given $A_2,...,a_n\in K^\ast$ write $A(a_1,...,a_n,\Gamma)$ for the number of solutions…

数论 · 数学 2007-05-23 J. -H. Evertse , H. P. Schlickewei , W. M. Schmidt

We mainly study a polynomial $f_{1,n}(x)=x^{n-1} + 2x^{n-2} + 3x^{n-3} + \cdots + kx^{n-k} + \cdots + (n-1)x + n$ over $\mathbb{Z}$ and the Galois group of the minimal splitting field. First, we show that an arbitrary root $\alpha_{n}$ of…

数论 · 数学 2017-01-16 Shinji Ishida

We present a method for computing complete lists of number fields in cases where the Galois group, as an abstract group, appears as a Galois group in smaller degree. We apply this method to find the twenty-five octic fields with Galois…

数论 · 数学 2016-11-11 John W. Jones , David P. Roberts