Abstract
This final lecture will discuss the proof of a recent result in joint work with Zakharov, bounding the size of subsets of F_p^n not containing p distinct vectors summing to zero. As discussed in the previous lecture, this leads to bounds for the Erdös-Ginzburg-Ziv Problem in high dimension. The proof uses the slice rank polynomial method in combination with other tools from additive combinatorics and probabilistic methods.
