English
Related papers

Related papers: Bounded gaps between primes in number fields and f…

200 papers

Starting with Zhang's theorem on the infinitude of prime doubles, we give an inductive argument that there exists an infinite number of prime $k$-tuples for at least one admissible set $\mathcal{H}_k=\{h_1,\ldots,h_k\}$ for each $k$.

Number Theory · Mathematics 2018-10-26 J. LaChapelle

A celebrated conjecture of Hardy and Littlewood provides with an asymptotic formula for the counting function of the twin primes. We give an unconditional proof of such a formula by means of a finite Ramanujan expansion of the counting…

General Mathematics · Mathematics 2020-08-31 Maurizio Laporta

We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…

Number Theory · Mathematics 2018-01-04 Hugues Randriam

We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of…

Number Theory · Mathematics 2015-03-06 Hans Parshall

We discuss recent advances on weak forms of the Prime $k$-tuple Conjecture, and its role in proving new estimates for the existence of small gaps between primes and the existence of large gaps between primes.

Number Theory · Mathematics 2019-10-31 James Maynard

Instead of a strong quantitative form of the Hardy-Littlewood prime $k$-tuple conjecture, one can assume an average form of it and still obtains the same distribution result on $\psi(x+h) - \psi(x)$ by Montgomery and Soundararajan [1].

Number Theory · Mathematics 2007-05-23 Tsz Ho Chan

As a refinement of the celebrated recent work of Yitang Zhang we show that any admissible k-tuple of integers contains at least two primes and almost primes in each component infinitely often if k is at least 181000. This implies that there…

Number Theory · Mathematics 2013-07-18 Janos Pintz

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

Number Theory · Mathematics 2007-05-23 D. A. Goldston , J. Pintz , C. Y. Yildirim

Let $m$ and $n$ be positive integers with $m,n \geq 2$. The second Hardy-Littlewood conjecture states that the number of primes in the interval $(m,m+n]$ is always less than or equal to the number of primes in the interval $[2,n]$. Based on…

Number Theory · Mathematics 2019-10-01 Christian Axler

We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite field, to show that for every $k$, the irreducible polynomials in $\mathbf{F}_q[t]$ contain configurations of the…

Number Theory · Mathematics 2009-09-02 Thai Hoang Le

We verify the Hardy-Littlewood conjecture on primes in quadratic progressions on average. The results in the present paper significantly improve those of a previous paper of the authors(arXiv:math.NT/0605563).

Number Theory · Mathematics 2009-10-15 Stephan Baier , Liangyi Zhao

Mockenhaupt and Tao (Duke 2004) proved a finite field analogue of the Stein--Tomas restriction theorem, establishing a range of $q$ for which $L^q\to L^2$ restriction estimates hold for a given measure $\mu$ on a vector space over a finite…

Combinatorics · Mathematics 2025-05-15 Jonathan M. Fraser , Firdavs Rakhmonov

The $p$-adic Littlewood Conjecture due to De Mathan and Teuli\'e asserts that for any prime number $p$ and any real number $\alpha$, the equation $$\inf_{|m|\ge 1} |m|\cdot |m|_p\cdot |\langle m\alpha \rangle|\, =\, 0 $$ holds. Here, $|m|$…

Number Theory · Mathematics 2020-10-13 Faustin Adiceam , Erez Nesharim , Fred Lunnon

We conjecture average counting functions for prime $k$-tuples based on a gamma distribution hypothesis for prime powers. The conjecture is closely related to the Hardy-Littlewood conjecture for $k$-tuples but yields better estimates.…

Number Theory · Mathematics 2018-10-26 J. LaChapelle

For each of the functions $f \in \{\phi, \sigma, \omega, \tau\}$ and every natural number $k$, we show that there are infinitely many solutions to the inequalities $f(p_n-1) < f(p_{n+1}-1) < \dots < f(p_{n+k}-1)$, and similarly for…

Number Theory · Mathematics 2014-08-07 Paul Pollack , Lola Thompson

Combining the Hardy-Littlewood k-tuple conjecture with a heuristic application of extreme-value statistics, we propose a family of estimator formulas for predicting maximal gaps between prime k-tuples. Computations show that the estimator…

Number Theory · Mathematics 2013-05-14 Alexei Kourbatov

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

Number Theory · Mathematics 2015-09-08 Janos Pintz

In the present work a new simple proof of the theorem of Gallagher about the average of the singular series in the Hardy-Littlewood prime k-tuple conjecture is proved (in an even stronger form) which is uniform with respect to k (if the…

Number Theory · Mathematics 2010-04-08 Janos Pintz

Green and Tao famously proved in a 2008 paper that there are arithmetic progressions of prime numbers of arbitrary lengths. Soon after, analogous statements were proved by Tao for the ring of Gaussian integers and by L\^e for the polynomial…

Number Theory · Mathematics 2022-04-12 Wataru Kai

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Number Theory · Mathematics 2019-08-15 Sam Porritt