加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本