arXiv subjects

Victor Zhenyu Guo

Publications and source records attributed to Victor Zhenyu Guo.

6 recordsLinked to original sources

arXiv2026

Piatetski-Shapiro Primes in short intervals

The existence of primes in a short interval, which asks if there are prime numbers in the interval $[x, x + x^θ]$, is a core problem in number theory. Guth and Maynard proved the best known result for this problem with an asymptotic formula while Baker, Harman and Pintz proved the best lower bound result. In this article, we focus on Piatetski-Shapiro primes in a short interval. The study of Piatetski-Shapiro primes of the form $\lfloor n^c \rfloor$ is an approximation of the well-known conjecture that there exist infinitely many primes of the form $n^2+1$. We prove the existence of such primes under restrictions on $θ$ and $c$ with an asymptotic formula and a lower bound, respectively.

math.NT↗

arXiv2026

Additive problems on $\lfloor p^c \rfloor$

The sequence $$ \mathbb{P}^{(c)}=(\lfloor p^c \rfloor)_{p\in \mathbb{P}}\quad (c>0,c\notin \mathbb{N}), $$ is an important subsequence of the well-known Piatetski-Shapiro sequence, where $\mathbb{P}$ is the set of prime numbers and $\lfloor \cdot \rfloor$ is the floor function. We prove that for all $c \in (0, 13/15)$, any large enough integer $N$ can be represented as $$ N=\lfloor p^c\rfloor+q, $$ where $p$ and $q$ are primes. We also prove the result holds for almost all fixed positive $c \in \mathbb{R}\setminus\mathbb{Z}$. Moreover, we investigate shifted primes in this sequence, obtaining an asymptotic formula for all $c \in (0, 13/15)$ and an almost-all result for fixed positive $c \in \mathbb{R}\setminus\mathbb{Z}$.

math.NT↗

arXiv2025

Exponential sums with polynomials and their applications to primes in sparse sets

Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an application, we study the Piatetski-Shapiro sequence of the form $(\lfloor n^c \rfloor)$ where $c > 1$ is not an integer. We improve the admissible range of the asymptotic formula for primes in the intersection of Piatetski-Shapiro sequences. We also study the iterated Piatetski-Shapiro sequence and prove an asymptotic formula for the prime counting function.

math.NT↗

arXiv2023

On a conjecture of R. M. Murty and V. K. Murty II

Let $ω^*(n)$ be the number of primes $p$ such that $p-1$ divides $n$. Assuming the Elliott--Halberstam Conjecture, we prove a conjecture posted by M. R. Murty and V. K. Murty in 2021 which states that $$\sum_{n\leqslant x}ω^*(n)^2\sim 2\frac{ζ(2)ζ(3)}{ζ(6)}x\log x, \quad \text{as} \quad x\rightarrow \infty.$$ The above sum was first investigated by Prachar in 1955. One of the key ingredients in our argument is the application of a sieve result on estimating various certain summations involving primes in arithmetic progressions, rather than a direct use of the Brun--Titchmarsh inequality which would not be applicable for our task.

math.NT↗

arXiv2021

Piatetski-Shapiro primes in the intersection of multiple Beatty sequences

Suppose that $α_1, α_2,β_1, β_2 \in\mathbb{R}$. Let $α_1, α_2 > 1$ be irrational and of finite type such that $1, α_1^{-1}, α_2^{-1}$ are linearly independent over $\mathbb{Q}$. Let $c$ be a real number in the range $1 < c < 12/11$. In this paper, it is proved that there exist infinitely many primes in the intersection of Beatty sequences $\mathcal{B}_{α_1,β_1} = \lfloorα_1 n + β_1\rfloor, \mathcal{B}_{α_2, β_2} = \lfloorα_2 n + β_2\rfloor$ and the Piatetski-Shapiro sequence $\mathscr{N}^{(c)} = \lfloor n^c\rfloor$. Moreover, we also give a sketch proof of Piatetski-Shapiro primes in the intersection of multiple Beatty sequences.

math.NT↗

arXiv2021

Beatty primes from fractional powers of almost-primes

Let $α>1$ be irrational and of finite type, $β\in\mathbb{R}$. In this paper, it is proved that for $R\geqslant13$ and any fixed $c\in(1,c_R)$, there exist infinitely many primes in the intersection of Beatty sequence $\mathcal{B}_{α,β}$ and $\lfloor n^c\rfloor$, where $c_R$ is an explicit constant depending on $R$ herein, $n$ is a natural number with at most $R$ prime factors, counted with multiplicity.

math.NT↗