2017
DOI: 10.1016/j.jnt.2016.07.008
|View full text |Cite
|
Sign up to set email alerts
|

Bounded gaps between Gaussian primes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
14
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 10 publications
(14 citation statements)
references
References 11 publications
0
14
0
Order By: Relevance
“…More importantly, the techniques of Maynard and Tao has been used by many mathematicians since then. In [1] and [14], this method has been extended to obtain bounded gap between primes in number fields and function fields.…”
Section: Introduction and Statement Of Resultsmentioning
confidence: 99%
“…More importantly, the techniques of Maynard and Tao has been used by many mathematicians since then. In [1] and [14], this method has been extended to obtain bounded gap between primes in number fields and function fields.…”
Section: Introduction and Statement Of Resultsmentioning
confidence: 99%
“…In that case, there exist infinitely many pairs of such Gaussian primes where their euclidean distance is bounded by an absolute constant. In 2017, Akshaa Vatwani [3] has conjectured this statement and proved it partially. Aksha's conjectures say that there exist infinitely many Gaussian prime pairs which are bounded by 246.…”
Section: Introductionmentioning
confidence: 95%
“…Before going to the proof we discuss the Gaussian primes with bounded length gaps because they prevent us to make an infinite sequence of Gaussian primes with an unbounded gap. In 2017, Akshaa Vatwani [3] has conjectured that Conjecture 1. Given any integers m 1 and m 2 having the same parity, there are infinitely many pairs of rational primes (p 1 , p 2 ) of the form…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…The fact that one can restrict the entire argument to an arithmetic progression also allows one to get some control on the joint distribution of various arithmetic functions. There have been many recent works making use of these flexibilities in the setup of the sieve method, including [58,13,7,21,48,34,3,39,4,14,61,59,46,47,28,5,6,1,32,43,49].…”
Section: Other Applications and Further Readingmentioning
confidence: 99%