On systems of complexity one in the primes

DOI10.1017/S001309151500053XzbMATH Open1419.11020arXiv1403.7040MaRDI QIDQ2976356FDOQ2976356

Authors: Kevin Henriot 

Publication date: 28 April 2017

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

Abstract: Consider a translation-invariant system of linear equations $Vx=0$ of complexity one, where $V$ is an integer $rimest$ matrix. We show that if $A$ is a subset of the primes up to $N$ of density at least $C(loglogN{)}^{-1/25t}$, there exists a solution $xin{A}^t$ to $Vx=0$ with distinct coordinates. This extends a quantitative result of Helfgott and de Roton for three-term arithmetic progressions, while the qualitative result is known to hold for all systems of equations of finite complexity by the work of Green and Tao.

Full work available at URL: https://arxiv.org/abs/1403.7040

Recommendations

• Linear equations in primes and dynamics of nilmanifolds
• The true complexity of a system of linear equations
• Linear inequalities in primes
• Linear equations in primes
• Linear equations in primes

zbMATH Keywords

Roth theorempseudo-randomnesslinear equations in primesadditive cominatoricscomplexity of linear systems

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Linear Diophantine equations (11D04)

Cites Work

• Title not available (Why is that?)
• A new proof of Szemerédi's theorem
• On triples in arithmetic progression
• The primes contain arbitrarily long polynomial progressions
• Roth's theorem in the primes
• The primes contain arbitrarily long arithmetic progressions
• Restriction theory of the Selberg sieve, with applications
• On \(\Lambda\) (p)-subsets of squares
• The true complexity of a system of linear equations
• Primes in tuples. I
• Linear equations in primes
• On Roth's theorem on progressions
• Behrend-type constructions for sets of linear equations
• A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression. II
• Translation invariant equations and the method of Sanders
• Higher correlations of divisor sums related to primes III: small gaps between primes
• On improving Roth's theorem in the primes
• On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
• Roth's theorem on systems of linear forms in function fields

Cited In (3)

• Small-scale distribution of linear patterns of primes
• Szemerédi's Theorem in the Primes
• Linear equations in primes and dynamics of nilmanifolds

This page was built for publication: On systems of complexity one in the primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976356)