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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.