2 citations · 2 across the 6 of their papers we have counts for
8 papers
On primes represented by quartic polynomials on average
Kam Hung Yau
We obtain an upper bound for the distribution of primes in the form up to , averaged over with small square-full part. As a corollary, we show that for almost all…
On products of primes and square-free integers in arithmetic progressions
Kam Hung Yau
We obtain an asymptotic formula for the number of ways to represent every reduced residue class as a product of a prime and square-free integer. This may be considered as a relaxed…
Representation of an integer as the sum of a prime in arithmetic progression and a square-free integer
Kam Hung Yau
Uniformly for small and , we obtain an estimate for the weighted number of ways a sufficiently large integer can be represented as the sum of a prime congruent to …
Product of an integer free of small prime factors and prime in arithmetic progression
Kam Hung Yau
We establish estimates for the number of ways to represent any reduced residue class as a product of a prime and an integer free of small prime factors. Our best results is conditi…
Smooth squarefree and square-full integers in arithmetic progressions
Marc Munsch, Igor E. Shparlinski, Kam Hung Yau
We obtain new lower bounds on the number of smooth squarefree integers up to in residue classes modulo a prime , relatively large compared to , which in some ranges of $p…
A refinement of the Burgess bound for character sums
Bryce Kerr, Igor E. Shparlinski, Kam Hung Yau
In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number . This continues a series of previous logarithmic improv…
Distribution of modulo 1 over integers free from large and small primes
Kam Hung Yau
For any , we obtain an asymptotic formula for the number of solutions to where is -smo…
Bounds of triple exponential sums with mixed exponential and linear terms
Kam Hung Yau
We establish bounds of triple exponential sums with mixed exponential and linear function. The method we use is by Shparlinski together with a bound of additive energy from Roche-N…