- document
-
Borst, Sander (author)The cap set problem consists of finding the maximum size cap sets, i.e. sets without a 3-term arithmetic progression in Fâ. In this thesis several known results on the behavior of this number as n â â are presented. In particular we discuss a reformulation by Terence Tao and Will Sawin of a proof found by Dion Gijswijt and Jordan Ellenberg. It...bachelor thesis 2018