Primes in sumsets (Q1692346): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963673333 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1710.07768 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On arithmetic properties of sumsets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The large sieve / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Additive energy of dense sets of primes and monochromatic sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3123961 / rank | |||
Normal rank |
Latest revision as of 01:18, 15 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Primes in sumsets |
scientific article |
Statements
Primes in sumsets (English)
0 references
26 January 2018
0 references
For each positive integer \(n\) and sets \(A,B\subseteq\{1,2,\dots,n\}\) let \(P_{A,B}(n)\) denote the number of pairs \((a,b)\in A\times B\) such that \(a+b\) is a prime number. In the paper under review, the author proves that if \(|A||B|\gg\frac{n^2}{\log^2n}\), then \(P_{A,B}(n)\ll \mathcal{B}_{A,B}(n)\), where \[ \mathcal{B}_{A,B}(n)=\frac{|A||B|}{\log n}\log\log\frac{1000n}{\sqrt{|A||B|}}. \] On the other hand, the author constructs sets \(A,B\) admitting the above conditions and \(P_{A,B}(n)\gg \mathcal{B}_{A,B}(n)\), hence proving that the above bound is optimal up to an implied constant. The proof use sieve methods and some properties of distribution of prime numbers in arithmetical progressions.
0 references
large sieve inequality
0 references
primes
0 references
Brun-Titchmarsh inequality
0 references