加载中…
We prove the expected asymptotic in Waring’s problem over , with a power-saving error, whenever , the characteristic is greater than , and satisfies an explicit lower bound. This range is sharp in general for the expected asymptotic uniformly in the target polynomial. Our main new input is an aggregate minor arc estimate: we count functionals according to the codimension of their associated singular loci and use intersection theory to bound the degrees of the resulting parameter spaces. In particular, if , the required lower bound on is polynomial in of degree .

生成讲解博客的中文版本

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