Linear equations in Piatetski-Shapiro primes
Xuancheng Shao, Yu-Chen Sun

TL;DR
This paper proves new results about the distribution of Piatetski-Shapiro primes, showing they contain arbitrarily long arithmetic progressions for certain parameters, extending previous work.
Contribution
It establishes discorrelation estimates between Piatetski-Shapiro primes and nilsequences, and proves the existence of arbitrarily long arithmetic progressions within these primes for a broader range of parameters.
Findings
Proves asymptotic formulas for solutions to linear systems in Piatetski-Shapiro primes.
Shows existence of infinitely many k-term arithmetic progressions in Piatetski-Shapiro primes for certain gamma.
Extends previous results to a wider range of gamma values close to 1.
Abstract
We establish discorrelation estimates between the Piatetski-Shapiro prime set \[ \mathcal{P}_{\gamma} := \{p \text{ is prime and } p = \lfloor n^{1/\gamma} \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} < \gamma < 1, \] then the Piatetski-Shapiro primes contain infinitely many non-trivial -term arithmetic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
