An additive problem in the theory of numbers
An additive problem with primes and almost-primes
An asymptotic formula for the number of representations in Waring's problem.
An asymptotic formula related to the divisors of the quaternary quadratic form
Let d(n) stand for the Dirichlet divisor function. We give an asymptotic formula for with the help of the circle method.
An ideal Waring problem with restricted summands
An Improved Bound for Prime Solutions of Some Ternary Equations.
An improved upper bound for G(k) in Waring's problem for relatively small k
Application of the circle method on multidimensional limit-periodic functions
Arithmetic progressions in sumsets
1. Introduction. Let A,B ⊂ [1,N] be sets of integers, |A|=|B|=cN. Bourgain [2] proved that A+B always contains an arithmetic progression of length . Our aim is to show that this is not very far from the best possible. Theorem 1. Let ε be a positive number. For every prime p > p₀(ε) there is a symmetric set A of residues mod p such that |A| > (1/2-ε)p and A + A contains no arithmetic progression of length (1.1). A set of residues can be used to get a set of integers in an obvious way. Observe...
Arithmetic progressions of prime-almost-prime twins
Asymptotic formulae for partition ranks
Using an extension of Wright's version of the circle method, we obtain asymptotic formulae for partition ranks similar to formulae for partition cranks which where conjectured by F. Dyson and recently proved by the first author and K. Bringmann.
Average Frobenius distribution of elliptic curves