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 Fqn without 3-term arithmetic progressions. We improve this bound by a factor n. In the case q=3, we also obtain more explicit upper bounds for the Cap Set Problem.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…