Cayley graphs generated by small degree polynomials over finite fields

We improve upper bounds of F. R. K. Chung and of M. Lu, D. Wan, L.-P. Wang, X.-D. Zhang on the diameter of some Cayley graphs constructed from polynomials over finite fields

On a Generalised Lehmer Problem for Arbitrary Powers

We consider a generalisation of the classical Lehmer problem about the parity distribution of an integer and its modular inverse. We use some known estimates of exponential sums to study a more general question of simultaneous distribution of the residues of any fixed number of negative and positive powers of integers in prescribed arithmetic progressions. In particular, we improve and generalise a recent result of Y. Yi and W. Zhang

On Gauss sums and the evaluation of Stechkin's constant

13 page(s

Cancellations Amongst Kloosterman Sums

We obtain several estimates for bilinear form with Kloosterman sums. Such results can be interpreted as a measure of cancellations amongst with parameters from short intervals. In particular, for certain ranges of parameters we improve some recent results of Blomer, Fouvry, Kowalski, Michel, and Mili\'cevi\'c (2014) and Fouvry, Kowalski and Michel (2014).Comment: 10 page

Distribution of Farey Fractions in Residue Classes and Lang--Trotter Conjectures on Average

We prove that the set of Farey fractions of order $T$, that is, the set \{\alpha/\beta \in \Q : \gcd(\alpha, \beta) = 1, 1 \le \alpha, \beta \le T\}, is uniformly distributed in residue classes modulo a prime $p$ provided T \ge p^{1/2 +\eps} for any fixed \eps>0. We apply this to obtain upper bounds for the Lang--Trotter conjectures on Frobenius traces and Frobenius fields ``on average'' over a one-parametric family of elliptic curves

Visible Points on Curves over Finite Fields

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$, with the additional condition $\gcd(x,y)=1$. Such solutions have a natural interpretation as solutions which are visible from the origin. These formulas are derived on average over $a$ for a fixed prime $p$, and also on average over $p$ for a fixed integer $a$

Prescribing the binary digits of squarefree numbers and quadratic residues

We study the equidistribution of multiplicatively defined sets, such as the squarefree integers, quadratic non-residues or primitive roots, in sets which are described in an additive way, such as sumsets or Hilbert cubes. In particular, we show that if one fixes any proportion less than $40\%$ of the digits of all numbers of a given binary bit length, then the remaining set still has the asymptotically expected number of squarefree integers. Next, we investigate the distribution of primitive roots modulo a large prime $p$, establishing a new upper bound on the largest dimension of a Hilbert cube in the set of primitive roots, improving on a previous result of the authors. Finally, we study sumsets in finite fields and asymptotically find the expected number of quadratic residues and non-residues in such sumsets, given their cardinalities are big enough. This significantly improves on a recent result by Dartyge, Mauduit and S\'ark\"ozy. Our approach introduces several new ideas, combining a variety of methods, such as bounds of exponential and character sums, geometry of numbers and additive combinatorics