We give an algorithmic proof of the majorizing measures theorem based on two parts: We make the simple (but apparently new) observation that finding the best majorizing measure can be cast as a convex program.Expand

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 →… Expand