Papers
Topics
Authors
Recent
Search
2000 character limit reached

A quantitative bound on Furstenberg-Sárközy patterns with shifted prime power common differences in primes

Published 23 Feb 2021 in math.NT and math.CO | (2102.11441v4)

Abstract: Let $k\geq1$ be a fixed integer, and $\mathcal P_N$ be the set of primes no more than $N$. We prove that if a set $\mathcal A\subset\mathcal P_N$ contains no patterns $p_1,p_1+(p_2-1)k$, where $p_1,p_2$ are prime numbers, then [ \frac{|\mathcal A|}{|\mathcal P_N|}\ll(\log\log N){-\frac{1}{4k3+23k2}}. ]

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.