Asymptotics for the number of directions determined by [n]×[n][n] \times [n] in Fp2\mathbb{F}_p^2

preprint2021arXivOpen access

Abstract

Let pp be a prime and nn a positive integer such that p2+1≤n≤p\sqrt{\frac p2} + 1 \leq n \leq \sqrt{p}. For any arithmetic progression AA of length nn in Fp\mathbb{F}_p, we establish an asymptotic formula for the number of directions determined by A×A⊂Fp2A \times A \subset \mathbb{F}_p^2. The key idea is to reduce the problem to counting the number of solutions to the bilinear Diophantine equation ad+bc=pad+bc=p in variables 1≤a,b,c,d≤n1\le a,b,c,d\le n; our asymptotic formula for the number of solutions is of independent interest.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.