中文

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

组合数学 2016-05-31 v1 数论

摘要

在本注记中,我们表明Croot、Lev和Pach的方法可用于将FqnF_q^n中无三项等差数列的子集大小限制在cnc^nc<qc < q)内。对于q=3q=3,寻找无三项等差数列的最大子集的问题被称为“帽问题”(cap problem)。先前由Bateman和Katz给出的帽问题的最佳已知上界为O(3n/n1+ϵ)O(3^n / n^{1+\epsilon})

关键词

引用

@article{arxiv.1605.09223,
  title  = {On large subsets of $F_q^n$ with no three-term arithmetic progression},
  author = {Jordan S. Ellenberg and Dion Gijswijt},
  journal= {arXiv preprint arXiv:1605.09223},
  year   = {2016}
}

备注

4 pages. This paper supersedes arXiv:1605.05492 and combines the solutions to the cap set problem independently obtained by the two authors