On Systems of Complexity One in the Primes
From MaRDI portal
Publication:2976356
DOI10.1017/S001309151500053XzbMath1419.11020arXiv1403.7040MaRDI QIDQ2976356
Publication date: 28 April 2017
Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.7040
pseudo-randomnessRoth theoremlinear equations in primesadditive cominatoricscomplexity of linear systems
Related Items (1)
Cites Work
- Unnamed Item
- Erratum to ``The primes contain arbitrarily long polynomial progressions
- On \(\Lambda\) (p)-subsets of squares
- A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression. II
- On Roth's theorem on progressions
- Primes in tuples. I
- The primes contain arbitrarily long polynomial progressions
- Roth's theorem in the primes
- Linear equations in primes
- On triples in arithmetic progression
- The primes contain arbitrarily long arithmetic progressions
- Restriction theory of the Selberg sieve, with applications
- On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
- Translation invariant equations and the method of Sanders
- Roth's theorem on systems of linear forms in function fields
- ON IMPROVING ROTH'S THEOREM IN THE PRIMES
- Higher correlations of divisor sums related to primes III: small gaps between primes
- Behrend-type constructions for sets of linear equations
- The true complexity of a system of linear equations
- A new proof of Szemerédi's theorem
This page was built for publication: On Systems of Complexity One in the Primes