函数域上的多项式方程
Polynomial equations in function fields
摘要:
Croot,Lev,Pach \cite{CLP}在$\Z_4^n$中关于无进展集的突破性论文介绍了一种多项式方法,该方法产生了丰富的应用,例如Ellenberg和Gijswijt对帽集问题\cite{EG}的解决方案。使用这种方法,我们绑定的一组多项式的$\F_q$的次数小于$n$,是免费的解决方案,以方程$\sum_{i=1}^k a_if_i^r=0$,其中系数$a_i$是多项式的总和为0,变量的数量满足$k\geq 2r^2+1$。我们得到的界限是$q^{cn}$的形式为某一常数$c<1$。这与已知的整数中相应问题的最佳界限形成对比,后者仅提供对数节省,但已经在$k\geq r^2+1$变量的情况下工作。
英文摘要:
The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem \cite{EG}. Using this method, we bound the size of a set of polynomials over $\F_q$ of degree less than $n$ that is free of solutions to the equation $\sum_{i=1}^k a_if_i^r=0$, where the coefficients $a_i$ are polynomials that sum to 0 and the number of variables satisfies $k\geq 2r^2+1$. The bound we obtain is of the form $q^{cn}$ for some constant $c<1$. This is in contrast to the best bounds known for the corresponding problem in the integers, which offer only a logarithmic saving, but work already with as few as $k\geq r^2+1$ variables.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。