Vector-covering systems of arithmetic sequences
For a prime p and an absolutely irreducible modulo p polynomial f(U,V) ∈ ℤ[U,V] we obtain an asymptotic formula for the number of solutions to the congruence f(x,y) ≡ a (mod p) in positive integers x ≤ X, y ≤ 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.
We obtain an asymptotic formula for the number of visible points (x,y), that is, with gcd(x,y) = 1, which lie in the box [1,U] × [1,V] and also belong to the exponential modular curves . Among other tools, some recent results of additive combinatorics due to J. Bourgain and M. Z. Garaev play a crucial role in our argument.