We report the results of our empirical investigations on the Bateman-Horn conjecture. This conjecture, in its commonly known form, produces rather large deviations when the polynomials involved are not monic. We propose a modified version of the conjecture which empirically demonstrates remarkable accuracy even for modest values of primes.
We establish cancellation in short sums of certain special trace functions over $\mathbb{F}_q[u]$ below the Pólya-Vinogradov range, with savings approaching square-root cancellation as $q$ grows. This is used to resolve the $\mathbb{F}_q[u]$-analog of Chowla's conjecture on cancellation in Möbius sums over polynomial sequences, and of the Bateman-Horn conjecture in degree $2$, for some values of $q$. A final application is to sums of trace functions over primes in $\mathbb{F}_q[u]$.
The Bateman-Horn conjecture is a far-reaching statement about the distribution of the prime numbers. It implies many known results, such as the prime number theorem and the Green-Tao theorem, along with many famous conjectures, such the twin prime conjecture and Landau's conjecture. We discuss the Bateman-Horn conjecture, its applications, and its origins.
The Multidimensional Bateman Horn Conjecture: Effective Estimates for the Tail of the Singular Series and an Algorithm for Computation with Guaranteed Accuracy
Bateman-Horn, polynomial Chowla and the Hasse principle with probability 1
IST Austria(奥地利科学技术研究所);Dipartimento di Matematica Università di Roma Tor Vergata(罗马托维加塔大学数学系);Department of Pure Mathematics and Mathematical Statistics University of Cambridge(剑桥大学纯数学与数理统计系)
In this paper, we determine the bound of the valency of the odd circulant graph which guarantees to be a Ramanujan graph for each fixed number of vertices. In almost of the cases, the bound coincides with the trivial bound, which comes from the trivial estimate of the largest non-trivial eigenvalue of the circulant graph. As exceptional cases, the bound in fact exceeds the trivial one by two. We then prove that such exceptionals occur only in the cases where the number of vertices has at most two prime factors and is represented by a quadratic polynomial in a finite family and, moreover, under…
As a consequence of the classification of finite simple groups, the classification of permutation groups of prime degree is complete, apart from the question of when the natural degree $(q^n-1)/(q-1)$ of ${\rm PSL}_n(q)$ is prime. We present heuristic arguments and computational evidence based on the Bateman-Horn Conjecture to support a conjecture that for each prime $n\ge 3$ there are infinitely many primes of this form, even if one restricts to prime values of $q$. Similar arguments and results apply to the parameters of the simple groups ${\rm PSL}_n(q)$, ${\rm PSU}_n(q)$ and ${\rm PSp}_{2n…
In this paper, we make a conjecture (conjecture 1) related to the Bateman-Horn conjecture and proceed to study the roots of $x^2+1$ and $x^2+2$ to prime moduli, assuming the truth of the Bateman-Horn conjecture and conjecture 1 and using the Erdős-Turan-Koksma inequality.
We use the Bateman--Horn Conjecture from number theory to give strong evidence of a positive answer to Peter Neumann's question, whether there are infinitely many simple groups of order a product of six primes. (Those with fewer than six were classified by Burnside, Frobenius and Hölder in the 1890s.) The groups satisfying this condition are ${\rm PSL}_2(8)$, ${\rm PSL}_2(9)$ and ${\rm PSL}_2(p)$ for primes $p$ such that $p^2-1$ has just six prime factors. The conjecture suggests that there are infinitely many such primes, by providing heuristic estimates for their distribution which agree clo…
This paper demonstrates that from the Cramer's, Hardy-Littlewood's and Bateman-Horn's conjectures (suggest that the probability of a large positive integer being $x$ a prime - $\frac {1} {\ln(x)}$) it follows that the events consisting in a positive integer $x$ being not divisible by different primes are dependent with the ratio $0,5e^γ$ ($γ$ - Euler's constant). In establishing Hardy-Littlewood's and Bateman-Horn's conjectures, their authors followed the first suggestion by another one assuming the independence of the above-mentioned events, which on the basis of the first suggestion and Mert…
We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$) polynomials $F_1,\ldots,F_m\in\mathbf{F}_q[t][x]$, with $q$ odd, we show that the number of $f\in\mathbf{F}_q[t]$ of degree $n\ge\max(3,\mathrm{deg}_t F_1,\ldots,\mathrm{deg}_t F_m)$ such that all $F_i(t,f)\in\mathbf{F}_q[t],1\le i\le m$ are irreducible is $$\left(\prod_{i=1}^m\frac{μ_i}{N_i}\right) q^{n+1}\left(1+O_{m,\,\max\mathrm{deg} F_i,\,n}\left(q^{-1/2}\right…
Given $β\in(0,1)$, we show the existence of a Beurling generalized number system whose integer counting satisfies $N(x) = ax + O\bigl(x\exp(-c\log^β x)\bigr)$ for some $a>0$ and $c>0$, and whose prime counting function satisfies $π(x) = \mathrm{Li}(x) + Ω\bigl(x\exp(-c'(\log x)^{\fracβ{β+1}})\bigr)$ for some $c'>0$. This is done by generalizing a construction of Diamond, Montgomery, and Vorhauer. This Beurling system serves as additional motivation for a conjecture of Bateman and Diamond from 1969, concerning the PNT with Malliavin-type remainder.
Stellenbosch University(斯泰伦博斯大学);University of Oxford(牛津大学);Graz University of Technology(格拉茨工业大学);Max Planck Institute for Software Systems(马克斯·普朗克软件研究所)
Garcia, Kahoro, and Luca showed that the Bateman-Horn conjecture implies $ϕ(p-1) \geq ϕ(p+1)$ for a majority of twin-primes pairs $p,p+2$ and that the reverse inequality holds for a small positive proportion of the twin primes. That is, $p$ tends to have more primitive roots than does $p+2$. We prove that Dickson's conjecture, which is much weaker than Bateman-Horn, implies that the quotients $\frac{ϕ(p+1)}{ϕ(p-1)}$, as $p,p+2$ range over the twin primes, are dense in the positive reals. We also establish several Schinzel-type theorems, some of them unconditional, about the behavior of $\frac{…