On a theorem of Sárközy for difference sets and shifted primes
arXiv:1906.03477 · doi:10.1016/j.jnt.2019.10.009
Abstract
We show that if the difference of two elements of a set is never one less than a prime number, then for some absolute constant .
arXiv commentTitle changed. Referee comments incorporated
References in corpus (1)
Cited by in corpus (5)
- An explicit version of Bombieri's log-free density estimate and Sárközy's theorem for shifted primes
- Lower bounds in the polynomial Szemerédi theorem
- On improving a Schur-type theorem in shifted primes
- A quantitative bound on Furstenberg-Sárközy patterns with shifted prime power common differences in primes
- Multivariate Polynomial Values in Difference Sets