Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Roth's Theorem in the Piatetski-Shapiro primes (1305.0043v2)

Published 30 Apr 2013 in math.CA

Abstract: Let $\mathbf{P}$ denote the set of prime numbers and, for an appropriate function $h$, define a set $\mathbf{P}{h}={p\in\mathbf{P}: \exists{n\in\mathbb{N}}\ p=\lfloor h(n)\rfloor}$. The aim of this paper is to show that every subset of $\mathbf{P}{h}$ having positive relative upper density contains a nontrivial three-term arithmetic progression. In particular the set of Piatetski--Shapiro primes of fixed type $71/72<\gamma<1$, i.e. ${p\in\mathbf{P}: \exists{n\in\mathbb{N}}\ p=\lfloor n{1/\gamma}\rfloor}$ has this feature. We show this by proving the counterpart of Bourgain--Green's restriction theorem for the set $\mathbf{P}_{h}$.

Summary

We haven't generated a summary for this paper yet.