Improved explicit upper bounds for the Cap Set Problem
Combinatorics
2023-01-09 v3 Number Theory
Abstract
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.
Keywords
Cite
@article{arxiv.2103.06481,
title = {Improved explicit upper bounds for the Cap Set Problem},
author = {Zhi Jiang},
journal= {arXiv preprint arXiv:2103.06481},
year = {2023}
}