Improved explicit upper bounds for the Cap Set Problem
Abstract
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2021
- DOI:
- arXiv:
- arXiv:2103.06481
- Bibcode:
- 2021arXiv210306481J
- Keywords:
-
- Mathematics - Combinatorics;
- Mathematics - Number Theory