  Let $G$ denote an Abelian group, written additively. A $3$-term arithmetic
progression of $G$, $3$-$\mathrm{AP}$ for short, is a set of three distinct
elements of $G$ of the form $g$, $g+d$, $g+2d$, for some $g,d \in G$. A set
$S\subseteq G$ is called $3$-$\mathrm{AP}$ free if it does not contain a
$3$-$\mathrm{AP}$. $S$ is called complete $3$-$\mathrm{AP}$ free if it is
$3$-$\mathrm{AP}$ free and the addition of any further element would violate
the $3$-$\mathrm{AP}$ free property. In case $S$ is not necessarily
$3$-$\mathrm{AP}$ free but for each $x \in G \setminus S$ there is a
$3$-$\mathrm{AP}$ of $G$ consisting of $x$ and two elements of $S$, we call $S$
saturating w.r.t. $3$-$\mathrm{AP}$s. A classical problem in additive
combinatorics is to determine the maximal size of a $3$-$\mathrm{AP}$ free set.
A classical problem in finite geometry and coding theory is to find the minimal
size of a complete cap in affine spaces, where a cap is a point set without a
collinear triplet and in $\mathbb{F}_3^n$ caps and $3$-$\mathrm{AP}$ free sets
are the same objects. In this paper we determine the minimum size of complete
$3$-$\mathrm{AP}$ free sets and $3$-$\mathrm{AP}$ saturating sets for several
families of vector spaces and cyclic groups, up to a small multiplicative
constant factor.
