arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1605.09223math.COmath.NT
收藏

关于无三项等差数列的$F_q^n$的大子集

On large subsets of $F_q^n$ with no three-term arithmetic progression

Jordan S. Ellenberg, Dion Gijswijt

摘要:

本文证明了Croot,Lev,Pach方法可用于由$c^n$和$c < q$确定等差数列中不含三项的$F_q^n$子集的大小.对于$q=3$,在等差数列中寻找没有三项的最大子集的问题被称为“帽问题”。在此之前,由于贝特曼和卡茨的研究,上限问题最著名的上界是$O(3^n / n^{1+ε})$。

英文摘要:

In this note, we show that the method of Croot, Lev, and Pach can be used to bound the size of a subset of $F_q^n$ with no three terms in arithmetic progression by $c^n$ with $c < q$. For $q=3$, the problem of finding the largest subset with no three terms in arithmetic progression is called the `cap problem'. Previously the best known upper bound for the cap problem, due to Bateman and Katz, was $O(3^n / n^{1+ε})$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑