2000 character limit reached
Roth's Theorem and the Hardy--Littlewood majorant problem for thin subsets of primes
Published 30 Dec 2022 in math.CA and math.NT | (2212.14513v1)
Abstract: We introduce a wide class of deterministic subsets of primes of zero relative density and we prove Roth's Theorem in these sets, namely, we show that any subset of them with positive relative upper density contains infinitely many non-trivial three-term arithmetic progressions. We also prove that the Hardy--Littlewood majorant property holds for these subsets of primes. Notably, our considerations recover the results for the Piatetski--Shapiro primes for exponents close to $1$, which are primes of the form $\lfloor nc\rfloor$ for a fixed $c>1$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.