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

关于$F_q^n$稠密子集中三项等差数列的个数

On the number of three-term arithmetic progressions in a dense subset of $F_q^n$

Shanshan Du, Hao Pan

摘要:

设$q$是奇素数幂。结合Varnavides的讨论和Ellenberg和Gijswijt最近的一个定理,我们证明了一个子集$A\subset{\mathbb F}_q^n$将包含许多非平凡的三项等差数列,每当$|A|\geq (c_q q)^n$为一些常数$c_q>0$。在我们的初稿上传到arXiv后,我们从Jacob Fox和Terence Tao教授那里得知,我们的结果是Fox和Lovasz [1,定理3]结果的一个特例。事实上,[1,定理3]给出了一个比我们更好的界。例如,当$q=3$时,Fox和Lovasz给出的下界是$|A|^{2}\cdot (|A|q^{-n})^{11.901}$,而我们的下限是$|A|^{2}\cdot (|A|q^{-n})^{25.803}$。我们感谢Jacob Fox教授和Terence Tao教授对我们的手稿提出的有益意见。[1]Jacob Fox,László Miklós Lovász,A tight bound for Green's arithmetic triangle removal lemma in vector spaces,preprint,arXiv:1606.01230.

英文摘要:

Let $q$ be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset $A\subset{\mathbb F}_q^n$ will contain many non-trivial three-term arithmetic progressions, whenever $|A|\geq (c_q q)^n$ for some constant $c_q>0$. After the first version of our manuscript was uploaded in the arXiv, we learned from Professors Jacob Fox and Terence Tao that our result is a special case of a result of Fox and Lovasz [1, Theorem 3]. In fact, [1, Theorem 3] gives a much better bound than ours. For example, when $q=3$, the lower bound given by Fox and Lovasz is $|A|^{2}\cdot (|A|q^{-n})^{11.901}$, while our bound is $|A|^{2}\cdot (|A|q^{-n})^{25.803}$. We thank Professors Jacob Fox and Terence Tao for their helpful comments on our manuscript. [1] Jacob Fox, László Miklós Lovász, A tight bound for Green's arithmetic triangle removal lemma in vector spaces, preprint, arXiv:1606.01230.

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

↑