arXiv Analytics

Sign in

arXiv:2103.06481 [math.CO]AbstractReferencesReviewsResources

Improved explicit upper bounds for the Cap Set Problem

Zhi Jiang

Published 2021-03-11Version 1

Ellenberg and Gijswijt gave the best known asymptotic upper bound for the cardinality of subsets of $\mathbb F_q^n$ without 3-term arithmetic progressions. We improve this bound by a factor $\sqrt{n}$. In the case $q=3$, we also obtain more explicit upper bounds for the Cap Set Problem.

Related articles: Most relevant | Search more
arXiv:1612.01929 [math.CO] (Published 2016-12-06)
Sumsets as unions of sumsets of subsets
arXiv:2106.05949 [math.CO] (Published 2021-06-10)
The lattice of arithmetic progressions
arXiv:1102.5438 [math.CO] (Published 2011-02-26, updated 2011-04-14)
Nonrepetitive sequences on arithmetic progressions