English

Vinogradov three prime theorem with Piatetski-Shapiro primes

Number Theory 2024-06-18 v4 Combinatorics

Abstract

We prove that, for any c1,c2,c3(1,41/35)c_1,c_2,c_3\in(1,41/35), every sufficiently large odd number NN can be represented as the sum of three primes N=p1+p2+p3N = p_1 + p_2 +p_3 such that pi=nicip_i = \lfloor n_{i}^{c_i}\rfloor for some niNn_i \in{\mathbb N} for each 1i31 \leq i \leq 3. Our arguments are based on a variant of Green's transference principle due to Matom\"aki, Maynard and Shao. We prove a necessary restriction estimate using Bourgain's strategy and employ Harman's sieve method to optimize our upper bound for cic_i.

Keywords

Cite

@article{arxiv.1912.12572,
  title  = {Vinogradov three prime theorem with Piatetski-Shapiro primes},
  author = {Yu-Chen Sun and Shanshan Du and Hao Pan},
  journal= {arXiv preprint arXiv:1912.12572},
  year   = {2024}
}

Comments

42 pages