Abstract
Let be a sufficiently dense subset of a finite field or a finite, cyclic ring . Assuming that and have no small prime divisors, we show that generalised Fermat equations have the expected number of solutions over . We further show that our density threshold is optimal. Our proofs involve average Fourier decay for Bohr sets, mixed character sum bounds, equidistribution of polynomial sequences, popular Cauchy--Davenport lemmas, and a regularity-type lemma due to Semchankau.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.