加载中…
We provide an improvement over Meshulam’s bound on cap sets in . We show that there exist universal and so that any cap set in has size at most . We do this by obtaining quite strong information about the additive combinatorial properties of the large spectrum.

生成讲解博客的中文版本

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