This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
In this note we give an overview of the currently known best lower and upper bounds on the size of a subset of ℤnm avoiding k-term arithmetic progression. We will focus on the case when the length of the forbidden progression is 3. We also formulate some open questions.