加载中…
Ellenberg and Gijswijt gave the best known asymptotic upper bound for the cardinality of subsets of without 3-term arithmetic progressions. We improve this bound by a factor . In the case , we also obtain more explicit upper bounds for the Cap Set Problem.

生成讲解博客的中文版本

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