paper

Linear equations in Piatetski-Shapiro primes

arXiv:2605.18676

Abstract

We establish discorrelation estimates between the Piatetski-Shapiro prime set \[ \mathcal{P}_γ := \{p \text{ is prime and } p = \lfloor n^{1/γ} \rfloor \text{ for some } n \in \mathbb{N}\} \] and arbitrary nilsequences when is sufficiently close to . This extends earlier works which treated linear or polynomial exponential phase functions. As an application, we establish an asymptotic formula for the number of solutions in to any "finite-complexity" system of linear equations, including for the number of -term arithmetic progressions in up to a threshold for any given . Furthermore, we show that there exists an absolute constant such that if \[ 1 - 2^{-Ck} < γ< 1, \] then the Piatetski-Shapiro primes contain infinitely many non-trivial -term arithmetic progressions. This significantly improves upon the previous range of obtained by Li and Pan, which is of triple exponential type.

22 pages

Linear equations in Piatetski-Shapiro primes · wovepaper